1461 search results - page 82 / 293 » Complexity of Graph Covering Problems |
104
Voted
CORR
2010
Springer
15 years 2 days ago
2010
Springer
We develop a theory of online learning by defining several complexity measures. Among them are analogues of Rademacher complexity, covering numbers and fatshattering dimension fro...
96
Voted
AI
2005
Springer
15 years 12 days ago
2005
Springer
We present a compiler that translates a problem specification into a propositional satisfiability test (SAT). Problems are specified in a logic-based language, called NP-SPEC, whi...
COR
2008
15 years 17 days ago
2008
The typical inventory routing problem deals with the repeated distribution of a single product from a single facility with an unlimited supply to a set of customers that can all b...
105
click to vote
MOBIHOC
2007
ACM
16 years 2 days ago
2007
ACM
In this paper we study the problem of scheduling wireless links in the geometric SINR model, which explicitly uses the fact that nodes are distributed in the Euclidean plane. We p...
82
Voted
ICALP
2004
Springer
15 years 5 months ago
2004
Springer
We first consider infinite two-player games on pushdown graphs. In previous work, Cachat, Duparc and Thomas [4] have presented a winning decidable condition that is Σ3-complete ...