4679 search results - page 520 / 936 » Modeling When Connections Are the Problem |
168
click to vote
ECAI
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. A well-known difficulty with solving Constraint Satisfaction Problems (CSPs) is that, while one formulation of a CSP may enable a solver to solve it quickly, a different ...
205
click to vote
JUCS
2008
15 years 6 months ago
2008
: Linguistics and stylistics have been investigated for author identification for quite a while, but recently, we have testified a impressive growth in the volume with which lawyer...
186
click to vote
STOC
2004
ACM
16 years 7 months ago
2004
ACM
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
203
click to vote
IJRR
2008
15 years 6 months ago
2008
One of the most general frameworks for phrasing control problems for complex, redundant robots is operational space control. However, while this framework is of essential importan...
149
click to vote
ICLP
2010
Springer
15 years 10 months ago
2010
Springer
We define the Tight Semantics (TS), a new semantics for all NLPs complying with the requirements of: 2-valued semantics; preserving the models of SM; guarantee of model existence...