2636 search results - page 349 / 528 » Linear Programming |
127
Voted
CP
2008
Springer
15 years 5 months ago
2008
Springer
Abstract. While the efficiency and scalability of modern SAT technology offers an intriguing alternative approach to constraint solving via translation to SAT, previous work has mo...
149
Voted
AAAI
2006
15 years 5 months ago
2006
Partially observable Markov decision processes (POMDPs) are an intuitive and general way to model sequential decision making problems under uncertainty. Unfortunately, even approx...
153
Voted
JCSS
2000
15 years 3 months ago
2000
We give the first nontrivial model-independent time-space tradeoffs for satisfiability. Namely, we show that SAT cannot be solved simultaneously in n1+o(1) time and n1space for an...
154
click to vote
CDC
2010
IEEE
14 years 10 months ago
2010
IEEE
Given linear matrix inequalities (LMIs) L1 and L2 in the same number of variables it is natural to ask: (Q1) does one dominate the other, that is, does L1(X) 0 imply L2(X) 0? (Q2) ...
148
Voted
CORR
2000
Springer
15 years 3 months ago
2000
Springer
Abstract. We investigate the evolutionary processes behind the development and optimization of multiple threads of execution in digital organisms using the avida platform, a softwa...