Sciweavers

2725 search results - page 382 / 545
» Constraint Solving for Interpolation
Sort
View
ICASSP
2009
IEEE
15 years 8 months ago
Design of robust superdirective beamformers as a convex optimization problem
Broadband data-independent beamforming designs aiming at constant beamwidth often lead to superdirective beamformers for low frequencies, if the sensor spacing is small relative t...
Edwin Mabande, Adrian Schad, Walter Kellermann
CAV
2004
Springer
121views Hardware» more  CAV 2004»
15 years 8 months ago
CirCUs: A Satisfiability Solver Geared towards Bounded Model Checking
Abstract. CirCUs is a satisfiability solver that works on a combination of AndInverter-Graph, CNF clauses, and BDDs. It has been designed to work well with bounded model checking. ...
HoonSang Jin, Mohammad Awedh, Fabio Somenzi
ATAL
2006
Springer
15 years 8 months ago
An agent based general solution model for the course timetabling problem
This paper proposes a general solution model using agent technology in order to solve two critical open issues in the course timetabling problem: application-specific issues and d...
Yan Yang, Raman Paranjape, Luigi Benedicenti
CP
2006
Springer
15 years 8 months ago
The Modelling Language Zinc
We describe the Zinc modelling language. Zinc provides set constraints, user defined types, constrained types, and polymorphic predicates and functions. The last allows Zinc to be ...
Maria J. García de la Banda, Kim Marriott, ...
ECAI
2006
Springer
15 years 8 months ago
Random Subset Optimization
Some of the most successful algorithms for satisfiability, such as Walksat, are based on random walks. Similarly, local search algorithms for solving constraint optimization proble...
Boi Faltings, Quang Huy Nguyen