16091 search results - page 379 / 3219 » Solving |
147
click to vote
CORR
2002
Springer
15 years 6 months ago
2002
Springer
We introduce a general and in a certain sense time-optimal way of solving one problem after another, efficiently searching the space of programs that compute solution candidates, i...
193
click to vote
JCSS
2000
15 years 6 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...
169
click to vote
IJMMS
1998
15 years 6 months ago
1998
: Decision-support systems that help solving problems in open and weak theory domains, i.e. hard problems, need improved methods to ground their models in real world situations. Mo...
156
click to vote
IJMMS
1998
15 years 6 months ago
1998
The knowledge-engineering literature contains a number of approaches for constructing or selecting problem solvers. Some of these approaches are based on indexing and selecting a ...
169
click to vote
JSA
1998
15 years 6 months ago
1998
In this paper, we present a network conscious approach to designing distributed real-time systems. Given a task graph design of the system, the end-to-end constraints on the input...