Sciweavers

1146 search results - page 156 / 230
» On the Complexity of Domain-Independent Planning
Sort
View
EDBT
2004
ACM
155views Database» more  EDBT 2004»
14 years 9 months ago
Processing Unions of Conjunctive Queries with Negation under Limited Access Patterns
We study the problem of answering queries over sources with limited access patterns. The problem is to decide whether a given query Q is feasible, i.e., equivalent to an executable...
Alan Nash, Bertram Ludäscher
ICDM
2009
IEEE
117views Data Mining» more  ICDM 2009»
14 years 4 months ago
Redistricting Using Heuristic-Based Polygonal Clustering
— Redistricting is the process of dividing a geographic area into districts or zones. This process has been considered in the past as a problem that is computationally too comple...
Deepti Joshi, Leen-Kiat Soh, Ashok Samal
ACHI
2008
IEEE
14 years 3 months ago
User-Centred Development of Mobile Interfaces to a Pervasive Computing Environment
—A challenging issue for HCI is the development of usable mobile interfaces for interactions with a complex pervasive environment. We consider a need for interfaces which automat...
Karin Leichtenstern, Elisabeth André
ICALT
2007
IEEE
14 years 3 months ago
Towards a Canonical View of Peer Assessment
Peer Assessment (or Peer Review) is a popular form of reciprocal assessment where students produce feedback, or grades, for each others work. Peer Assessment activities can be ext...
David E. Millard, Karen Fill, Lester Gilbert, Yvon...
ICRA
2007
IEEE
89views Robotics» more  ICRA 2007»
14 years 3 months ago
Probabilistic Strategies for Pursuit in Cluttered Environments with Multiple Robots
Abstract— In this paper, we describe a method for coordinating multiple robots in a pursuit-evasion domain. We examine the problem of multiple robotic pursuers attempting to loca...
Geoffrey Hollinger, Athanasios Kehagias, Sanjiv Si...