Sciweavers

4488 search results - page 356 / 898
» Properties of NP-Complete Sets
Sort
View
ICDT
2005
ACM
125views Database» more  ICDT 2005»
16 years 1 months ago
PTIME Queries Revisited
The existence of a language expressing precisely the PTIME queries on arbitrary structures remains the central open problem in the theory of database query languages. As it turns o...
Alan Nash, Jeffrey B. Remmel, Victor Vianu
JELIA
2004
Springer
16 years 28 days ago
Representation and Complexity in Boolean Games
Boolean games are a class of two-player games which may be defined via a Boolean form over a set of atomic actions. A particular game on some form is instantiated by partitioning ...
Paul E. Dunne, Wiebe van der Hoek
ICRA
2003
IEEE
222views Robotics» more  ICRA 2003»
16 years 25 days ago
Path planning using learned constraints and preferences
— In this paper we present a novel method for robot path planning based on learning motion patterns. A motion pattern is defined as the path that results from applying a set of ...
Gregory Dudek, Saul Simhon
INFOCOM
2003
IEEE
16 years 25 days ago
Sampling Biases in IP Topology Measurements
— Considerable attention has been focused on the properties of graphs derived from Internet measurements. Router-level topologies collected via traceroute-like methods have led s...
Anukool Lakhina, John W. Byers, Mark Crovella, Pen...
IMC
2003
ACM
16 years 24 days ago
On the number of distributed measurement points for network tomography
Internet topology information is only made available in aggregate form by standard routing protocols. Connectivity information and latency characteristicsmust therefore be inferre...
Joseph Douglas Horton, Alejandro López-Orti...