1650 search results - page 154 / 330 » The HOM problem is decidable |
152
click to vote
COCO
2007
Springer
16 years 16 days ago
2007
Springer
We make progress in understanding the complexity of the graph reachability problem in the context of unambiguous logarithmic space computation; a restricted form of nondeterminism....
159
click to vote
EVOW
2007
Springer
16 years 15 days ago
2007
Springer
In this paper we study a complex real-world workforce scheduling problem. We propose a method of splitting the problem into smaller parts and solving each part using exhaustive sea...
186
click to vote
AGP
1999
IEEE
15 years 10 months ago
1999
IEEE
Disunification is the problem of deciding satisfiability of a system of equations and disequations with respect to a given equational theory. In this paper we study the disunifica...
166
click to vote
SEBD
2007
15 years 7 months ago
2007
We consider the problem of query containment over an object data model derived from F-logic. F-logic has generated considerable interest commercially, in the academia, and within ...
167
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
Internet search companies sell advertisement slots based on users' search queries via an auction. While there has been previous work on the auction process and its game-theor...