230 search results - page 39 / 46 » Quantum Search with Variable Times |
C3S2E
2010
ACM
13 years 11 months ago
2010
ACM
Propositional satisfiability solving, or SAT, is an important reasoning task arising in numerous applications, such as circuit design, formal verification, planning, scheduling or...
CEC
2010
IEEE
13 years 11 months ago
2010
IEEE
Learning Bayesian networks from data is an N-P hard problem with important practical applications. Several researchers have designed algorithms to overcome the computational comple...
JUCS
2008
13 years 9 months ago
2008
Abstract: Nowadays, in the markets of broadband access services, traditional contracts are of "static" type. Customers buy the right to use a specific amount of resources...
AIR
2004
13 years 9 months ago
2004
Abstract. In this work we study an over-constrained scheduling problem where constraints cannot be relaxed. This problem originates from a local defense agency where activities to ...
CORR
2004
Springer
13 years 9 months ago
2004
Springer
Abstract. This paper presents two different efficiency-enhancement techniques for probabilistic model building genetic algorithms. The first technique proposes the use of a mutatio...