Sciweavers

536 search results - page 27 / 108
» A Translational Approach to Constraint Answer Set Solving
Sort
View
JAIR
2010
145views more  JAIR 2010»
15 years 2 months ago
Fast Set Bounds Propagation Using a BDD-SAT Hybrid
Binary Decision Diagram (BDD) based set bounds propagation is a powerful approach to solving set-constraint satisfaction problems. However, prior BDD based techniques incur the si...
Graeme Gange, Peter J. Stuckey, Vitaly Lagoon
95
Voted
ECAI
2006
Springer
15 years 7 months ago
On Probing and Multi-Threading in Platypus
The PLATYPUS approach offers a generic platform for distributed answer set solving, accommodating a variety of different architectures for distributing the search for answer sets a...
Jean Gressmann, Tomi Janhunen, Robert E. Mercer, T...
ICCAD
1996
IEEE
80views Hardware» more  ICCAD 1996»
15 years 8 months ago
Generalized constraint generation in the presence of non-deterministic parasitics
In a constraint-drivenlayout synthesisenvironment,parasitic constraints are generated and implemented in each phase of the design process to meet a given set of performance specif...
Edoardo Charbon, Paolo Miliozzi, Enrico Malavasi, ...
ESA
2010
Springer
162views Algorithms» more  ESA 2010»
15 years 4 months ago
Solving an Avionics Real-Time Scheduling Problem by Advanced IP-Methods
We report on the solution of a real-time scheduling problem that arises in the design of software-based operation control of aircraft. A set of tasks has to be distributed on a min...
Friedrich Eisenbrand, Karthikeyan Kesavan, Raju S....
GECCO
2005
Springer
138views Optimization» more  GECCO 2005»
15 years 9 months ago
Artificial immune system for solving generalized geometric problems: a preliminary results
Generalized geometric programming (GGP) is an optimization method in which the objective function and constraints are nonconvex functions. Thus, a GGP problem includes multiple lo...
Jui-Yu Wu, Yun-Kung Chung