9842 search results - page 1339 / 1969 » The Complexity of the Matching-Cut Problem |
198
Voted
EDBT
2008
ACM
16 years 7 months ago
2008
ACM
The spatial and temporal databases have been studied widely and intensively over years. In this paper, we study how to answer queries of finding the best departure time that minim...
213
click to vote
ISAAC
2007
Springer
16 years 1 months ago
2007
Springer
Valiant introduced some 25 years ago an algebraic model of computation along with the complexity classes VP and VNP, which can be viewed as analogues of the classical classes P and...
227
click to vote
EDBTW
2004
Springer
16 years 20 days ago
2004
Springer
Many users and applications require the integration of semi-structured data from autonomous, heterogeneous Web sources. Over the last years mediator systems have emerged that use d...
187
click to vote
ICRA
2003
IEEE
16 years 16 days ago
2003
IEEE
Existing task allocation algorithms generally do not consider the effects of task interaction, such as interference, but instead assume that tasks are independent. That assumptio...
203
click to vote
CEC
2009
IEEE
16 years 2 months ago
2009
IEEE
— Legged robots show promise for complex mobility tasks, such as navigating rough terrain, but the design of their control software is both challenging and laborious. Traditional...