Sciweavers

400 search results - page 46 / 80
» A Synthesis of Constraint Satisfaction and Constraint Solvin...
Sort
View
JAIR
2010
145views more  JAIR 2010»
15 years 4 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
154
Voted
VLSID
2003
IEEE
123views VLSI» more  VLSID 2003»
16 years 6 months ago
Synthesis of Real-Time Embedded Software by Timed Quasi-Static Scheduling
A formal synthesis method for complex real-time embedded software is proposed in this work. Compared to previous work, our method not only synthesizes embedded software with compl...
Pao-Ann Hsiung, Feng-Shi Su
SIGITE
2006
ACM
16 years 1 days ago
Does a virtual networking laboratory result in similar student achievement and satisfaction?
Delivery of content in networking and system administration curricula involves significant hands-on laboratory experience supplementing traditional classroom instruction at the Ro...
Edith A. Lawson, William Stackpole
GIS
2007
ACM
16 years 7 months ago
Exploiting automatically inferred constraint-models for building identification in satellite imagery
The building identification (BID) problem is based on a process that uses publicly available information to automatically assign addresses to buildings in satellite imagery. In pr...
Martin Michalowski, Craig A. Knoblock, Kenneth M. ...
PRICAI
2004
Springer
15 years 11 months ago
Solving Over-Constrained Temporal Reasoning Problems Using Local Search
Temporal reasoning is an important task in many areas of computer science including planning, scheduling, temporal databases and instruction optimisation for compilers. Given a kno...
Matthew Beaumont, John Thornton, Abdul Sattar, Mic...