100 search results - page 17 / 20 » A distance-labelling problem for hypercubes |
MP
2008
13 years 9 months ago
2008
This paper proposes an efficient computational technique for the optimal control of linear discrete-time systems subject to bounded disturbances with mixed polytopic constraints o...
CORR
2006
Springer
13 years 10 months ago
2006
Springer
Boolean satisfiability problems are an important benchmark for questions about complexity, algorithms, heuristics and threshold phenomena. Recent work on heuristics, and the satis...
COCOON
2009
Springer
14 years 4 months ago
2009
Springer
Given a complete binary tree of height h, the online tree node assignment problem is to serve a sequence of assignment/release requests, where an assignment request, with an integ...
FOCS
2006
IEEE
14 years 3 months ago
2006
IEEE
Learning an unknown halfspace (also called a perceptron) from labeled examples is one of the classic problems in machine learning. In the noise-free case, when a halfspace consist...
FOCS
2006
IEEE
14 years 3 months ago
2006
IEEE
We advance significantly beyond the recent progress on the algorithmic complexity of Nash equilibria by solving two major open problems in the approximation of Nash equilibria an...