8413 search results - page 468 / 1683 » Ordering Problem Subgoals |
166
click to vote
JCT
2010
15 years 5 months ago
2010
We show that for each η > 0 every digraph G of sufficiently large order n is Hamiltonian if its out- and indegree sequences d+ 1 ≤ · · · ≤ d+ n and d− 1 ≤ · · · â...
167
click to vote
ICMLA
2010
15 years 4 months ago
2010
Abstract--Support vector machines (SVMs) were initially proposed to solve problems with two classes. Despite the myriad of schemes for multiclassification with SVMs proposed since ...
184
click to vote
LPAR
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Grounding is the task of reducing a first order formula to ground formula that is equivalent on a given universe, and is important in many kinds of problem solving and re...
158
click to vote
TACAS
2010
Springer
15 years 4 months ago
2010
Springer
The choice of where a thread scheduling algorithm preempts one thread in order to execute another is essential to reveal concurrency errors such as atomicity violations, livelocks,...
260
click to vote
CPM
2009
Springer
15 years 4 months ago
2009
Springer
The longest-common-prefix (LCP) array is an adjunct to the suffix array that allows many string processing problems to be solved in optimal time and space. Its construction is a bo...