- Symmetry Breaking for Pseudo-Boolean FADI A. ALOUL
- Optimized solvers for the Boolean Satisfiability (SAT) prob-lem have many applications in areas such as hardware and
- Journal of the Franklin Institute ] (]]]]) ]]]]]] Search techniques for SAT-based
- Abstract --In mobile radio communication systems using spread spectrum technology, an accurate estimate of the signal
- We introduce a new approach to Boolean satisfiability that combines backtrack search techniques and zero-sup-
- Dynamic Posting of Static Symmetry Breaking Constraints George Katsirelos
- Satometer: How Much Have We Searched? Fadi A. Aloul
- Abstract--Unmanned aerial vehicles (UAVs) represent an impor-tant class of networked robotic applications that must be both highly de-
- Confluence of reduction rules for lexicographic ordering constraints Andrew Grayland1
- Journal of the Franklin Institute ] (]]]]) ]]]]]] M-stock: Efficient stock monitoring for mobile users
- 1666 IEEE SENSORS JOURNAL, VOL. 10, NO. 10, OCTOBER 2010 A Mobile GPRS-Sensors Array for
- International Journal of Mathematics and Computer Science, 4(2009), no. 2, 6580
- Solution and Optimization of Systems of Pseudo-Boolean Constraints
- Abstract--Today, most routing problems are solved using Dijkstra's shortest path algorithm. Many efficient implementa-
- MINCE: A Static Global Variable-Ordering Heuristic for SAT Search and BDD Manipulation
- A Comparative Study of Two Boolean Formulations of
- Contextualizing Cross-Discipline Teaching and Learning Through Engineering Multidisciplinary Projects (EMDPs)
- Two Factor Authentication Using Mobile Phones Fadi Aloul, Syed Zahidi
- Abstract --Optical networks consist of switches that are con-nected using fiber optics links. Each link consists of a set of wave-
- Solving the University Class Scheduling Problem Using Advanced ILP Techniques
- Estimation of the Weighted Maximum Switching Activity in Combinational CMOS Circuits Fadi A. Aloul andAssim Sagahyroon
- F. A. Aloul, A. Ramani, I. L. Markov, K. A. Sakallah Many important tasks in circuit design and verification can be per-
- Solving Difficult SAT Instances in the Presence of Symmetry
- Interest in propositional satisfiability (SAT) has been on the rise lately, spurred in part by the recent availability of
- Solving Difficult Instances of Boolean Satisfiability in the Presence of Symmetry
- Lightweight Dynamic Symmetry Breaking C. Mears, M. Garcia de la Banda, B. Demoen, M. Wallace
- Symmetry Breaking by Metaheuristic Search S. D. Prestwich1
- Symmetry and Non-monotonic Inference Belaid Benhamou and Pierre Siegel
- SECURITY AND COMMUNICATION NETWORKS Security Comm. Networks. (2010)
- MINCE: A Static Global Variable-Ordering for SAT and BDD
- American University of Sharjah School of Engineering
- Abstract --This paper presents a new technique for multipath detection in wideband mobile radio systems. An intelligent search
- IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, VOL. 22, NO. 8, AUGUST 2003 995 Satometer: How Much Have We Searched?
- The increasing popularity of SAT and BDD techniques in ver-ification and synthesis encourages the search for additional
- M-Stock: Efficient Stock Monitoring for Mobile Users Fadi Aloul, Assim Sagahyroon, Nancy Salem, Omar Al-Omar, Sahar Shehada
- J. Marques-Silva and K.A. Sakallah (Eds.): SAT 2007, LNCS 4501, pp. 369 376, 2007. Springer-Verlag Berlin Heidelberg 2007
- We introduce a new approach to satisfiability that com-bines backtrack search techniques and zero-suppressed
- Microelectronics Journal 38 (2007) 706715 Using SAT-based techniques in power estimation
- The MINCE heuristic for variable-ordering [1] can successfully reduce the size of BDDs and accelerate SAT-solving. Applications
- We introduce a new approach to Boolean satisfiability (SAT) that combines backtrack search techniques and
- We introduce Satometer, a tool that can be used to estimate the percentage of the search space actually explored by a
- To excite a stuck-open fault in a CMOS combinational circuit, it is only necessary that the output of the gate con-
- Abstract -State assignment for finite state machines is a criti-cal optimization problem in the synthesis of sequential circuits.
- Wireless Security in UAE: A Survey Paper Amir Kalbasi, Omar Alomar, Mohammad Hajipour, Fadi Aloul
- Current and Future Trends in Sensor Networks: A Survey Mokhtar Aboelaze*
- Efficient Verification of the PCI Local Bus using Boolean Satisfiability
- Model Restarts for Structural Symmetry Breaking Daniel Heller, Aurojit Panda, Meinolf Sellmann, Justin Yip
- Abstract -Dynamic burn-in testing is an integral component of any test plan that seeks to produce reliable integrated circuits.
- Dominance in Incomplete Solvers for the Multiple Knapsack Problem Alex S. Fukunaga
- Abstract--Intrusion detection is a mechanism used to detect various attacks on a wired or wireless network. Port scanning is
- Symmetry Breaking in Local Search for Unsatisfiability Dept of Computer Engineering,
- Mobile RFID Tracking System A. R. Al-Ali, Fadi A. Aloul, Nada R. Aji, Amin A. Al-Zarouni, Nassar H. Fakhro
- Robust SAT-Based Search Algorithm for Leakage Power Reduction
- Solving Difficult SAT Instances in the Presence of Symmetry Fadi A. Aloul, Arathi Ramani, Igor L. Markov and Karem A. Sakallah
- Identifying and breaking the symmetries of CNF for-mulae has been shown to lead to significant reductions
- Boolean functions are fundamental to synthesis and veri-fication of digital logic, and compact representations of
- Breaking Instance-Independent Symmetries in Exact Graph Coloring Arathi Ramani, Fadi A. Aloul, Igor L. Markov and Karem A. Sakallah
- Generic ILP versus Specialized 0-1 ILP: An Update Fadi A. Aloul, Arathi Ramani, Igor L. Markov, Karem A. Sakallah
- The Synthesis of Dependable Communication Networks for Automotive Systems
- We introduce a new verification methodology for modern micro-processors that uses a simple checker processor to validate the exe-
- Transmission coordination for ad hoc networks Ananth V. Kini, Steven Weber, Fadi Aloul, Nagarajan Kandasamy
- Proceeding of the First International Conference on Modeling, Simulation and Applied Optimization, Sharjah, U.A.E. February 1-3, 2005 ICMSAO/05-1
- Abstract --The Employee Timetabling Problem (ETP) is concerned with assigning a number of employees into a given
- Breaking Instance-Independent Symmetries in Exact Graph Coloring Arathi Ramani
- Prescott: Engineering communication interface. October 2010 Engineering Communication Interface: An Engineering Multidisciplinary Project.
- Using Mobiles for On Campus Location Tracking F. Aloul A. Sagahyroon A. Al-Shami I. Al-Midfa R. Moutassem
- Noname manuscript No. (will be inserted by the editor)
- An Experimental Evaluation of Conflict Diagnosis and Recursive Learning in Boolean Satisfiability
- 1-4244-0674-9/06/$20.00 2006 IEEE. PolluMap: A Pollution Mapper for Cities
- Efficient Symmetry Breaking for Boolean Satisfiability
- Fifth International Symposium on Theory and Applications of Satisfiability Testing, May 6-9, 2000, Cincinnati, Ohio Optimized solvers for the Boolean Satisfiability (SAT)
- A Boolean-based router expresses the routing constraints as a Bool-ean function which is satisfiable if and only if the layout is routable.
- Monitoring Patients' Signs Wirelessly A. Sagahyroon, F. Aloul, A.R. Al-Ali, M. S. Bahrololoum, F. Makhsoos, N. Hussein
- Dynamic Symmetry-Breaking for Improved Boolean Optimization Fadi A. Aloul, Arathi Ramani, Igor L. Markov and Karem A. Sakallah
- The continuing decrease in feature size and increase in chip density is causing leakage current to be a major contributor to
- Boolean functions are fundamental to synthesis and veri-fication of digital logic, and compact representations of
- Boolean Satisfiability solvers improved dramatically over the last seven years [14, 13] and are commonly
- IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, VOL. 22, NO. 9, SEPTEMBER 2003 1117 Solving Difficult Instances of Boolean Satisfiability
- Symmetry Breaking and Branching Constraints C. Mears, M. Garcia de la Banda, M. Wallace, B. Demoen
- Boolean satisfiability (SAT) solvers have experienced dramatic im-provements in their performance and scalability over the last several
- We introduce Satometer, a tool that can be used to estimate the per-centage of the search space actually explored by a backtrack SAT
- Monitoring Patients' Signs Wirelessly A. Sagahyroon, F. Aloul, A.R. Al-Ali, M. S. Bahrololoum, F. Makhsoos, N. Hussein
- Engineering communication interface; US China Education Review Engineering communication interface: an engineering multidisciplinary
- The 2011 Barcelona European Academic Conference Barcelona, Spain 2011 Teaching, Innovation and the Engineering
- The Need for Effective Information Security Awareness
