5493 search results - page 271 / 1099 » Effectively Polynomial Simulations |
172
click to vote
SAT
2005
Springer
16 years 3 days ago
2005
Springer
We introduce two incomplete polynomial time algorithms to solve satisfiability problems which both use Linear Programming (LP) techniques. First, the FlipFlop LP attempts to simul...
152
click to vote
CP
2004
Springer
16 years 13 hour ago
2004
Springer
Abstract. Refutation proofs can be viewed as a special case of constraint propagation, which is a fundamental technique in solving constraint-satisfaction problems. The generalizat...
195
click to vote
HYBRID
2004
Springer
16 years 2 hour ago
2004
Springer
We present a parameter inference algorithm for autonomous stochastic linear hybrid systems, which computes a maximum-likelihood model, given only a set of continuous output data of...
155
click to vote
INFOCOM
2003
IEEE
15 years 12 months ago
2003
IEEE
Abstract— Finding a path in a network based on multiple constraints (the MCP problem) is often referred to as QoS routing. QoS routing with constraints on multiple additive metri...
169
click to vote
CASES
2003
ACM
15 years 12 months ago
2003
ACM
Focusing on embedded applications, scratchpad memories (SPMs) look like a best-compromise solution when taking into account performance, energy consumption and die area. The main ...