18306 search results - page 285 / 3662 » Algorithmics in Exponential Time |
191
Voted
CP
2000
Springer
15 years 10 months ago
2000
Springer
We are interested in the expressiveness of constraints represented by general first order formulae, with equality as unique relation symbol and function symbols taken from an infi...
177
click to vote
CCS
2008
ACM
15 years 8 months ago
2008
ACM
To ensure that a trust negotiation succeeds whenever possible, authorization policy compliance checkers must be able to find all minimal sets of their owners' credentials tha...
181
click to vote
COMPGEOM
2008
ACM
15 years 8 months ago
2008
ACM
Manifold reconstruction has been extensively studied for the last decade or so, especially in two and three dimensions. Recent advances in higher dimensions have led to new method...
162
click to vote
NIPS
2007
15 years 8 months ago
2007
In the online linear optimization problem, a learner must choose, in each round, a decision from a set D ⊂ Rn in order to minimize an (unknown and changing) linear cost function...
175
click to vote
CORR
2006
Springer
15 years 6 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...