230 search results - page 29 / 46 » Quantum Search with Variable Times |
100
Voted
DOCENG
2006
ACM
15 years 6 months ago
2006
ACM
In many text-processing applications, we would like shapes that expand (or shrink) in size to fit their textual content. We address how to efficiently compute the minimum size fo...
89
Voted
GLVLSI
2003
IEEE
15 years 5 months ago
2003
IEEE
The MINCE heuristic for variable-ordering [1] successfully reduces the size of BDDs and can accelerate SAT-solving. Applications to reachability analysis have also been successful...
DATE
2002
IEEE
15 years 5 months ago
2002
IEEE
We have developed a technique to compute a Quasi Static Schedule of a concurrent specification for the software partition of an embedded system. Previous work did not take into a...
112
click to vote
CSCLP
2006
Springer
15 years 4 months ago
2006
Springer
A number of different satisfaction and optimisation combinatorial problems have recently been approached with constraint programming over the domain of finite sets, for increased d...
88
Voted
ATAL
2005
Springer
15 years 6 months ago
2005
Springer
We describe a Multi-Agent System (MAS) for controlling teams of uninhabited air vehicles (UAVs) in the context of a larger system that has been used to evaluate potential concepts...