Sciweavers

2398 search results - page 447 / 480
» Constraint Programming and Graph Algorithms
Sort
View
CODES
2007
IEEE
14 years 5 months ago
Locality optimization in wireless applications
There is a strong need now for compilers of embedded systems to find effective ways of optimizing series of loop-nests, wherein majority of the memory references occur in the fo...
Javed Absar, Min Li, Praveen Raghavan, Andy Lambre...
CP
2007
Springer
14 years 5 months ago
Min-Domain Ordering for Asynchronous Backtracking
Ordering heuristics are a powerful tool in CSP search algorithms. Among the most successful ordering heuristics are heuristics which enforce a fail first strategy by using the mi...
Roie Zivan, Moshe Zazone, Amnon Meisels
MM
2006
ACM
134views Multimedia» more  MM 2006»
14 years 4 months ago
Autonomous light air vessels (ALAVs)
Through a defined research process we designed objects that behave and respond in specific ways and are part of a networked system that emphasizes autonomous and flocking behavior...
Jed Berk, Nikhil Mitter
ISQED
2005
IEEE
84views Hardware» more  ISQED 2005»
14 years 4 months ago
Performance Driven OPC for Mask Cost Reduction
With continued aggressive process scaling in the subwavelength lithographic regime, resolution enhancement techniques (RETs) such as optical proximity correction (OPC) are an inte...
Puneet Gupta, Andrew B. Kahng, Dennis Sylvester, J...
CP
2005
Springer
14 years 4 months ago
Using SAT in QBF
QBF is the problem of deciding the satisfiability of quantified boolean formulae in which variables can be either universally or existentially quantified. QBF generalizes SAT (S...
Horst Samulowitz, Fahiem Bacchus