Sciweavers

784 search results - page 61 / 157
» Relaxing the Value Restriction
Sort
View
ICRA
2010
IEEE
119views Robotics» more  ICRA 2010»
13 years 7 months ago
Evader surveillance under incomplete information
— This paper is concerned with determining whether a mobile robot, called the pursuer, is up to maintaining visibility of an antagonist agent, called the evader. This problem, a ...
Israel Becerra, Rafael Murrieta-Cid, Raul Monroy
HEURISTICS
2010
13 years 6 months ago
An adaptive memory algorithm for the split delivery vehicle routing problem
Abstract The split delivery vehicle routing problem (SDVRP) relaxes routing restrictions forcing unique deliveries to customers and allows multiple vehicles to satisfy customer dem...
Rafael E. Aleman, Xinhui Zhang, Raymond R. Hill
CALCO
2011
Springer
214views Mathematics» more  CALCO 2011»
12 years 9 months ago
Indexed Induction and Coinduction, Fibrationally
This paper extends the fibrational approach to induction and coinduction pioneered by Hermida and Jacobs, and developed by the current authors, in two key directions. First, we pr...
Clément Fumex, Neil Ghani, Patricia Johann
SIGMOD
2001
ACM
213views Database» more  SIGMOD 2001»
14 years 9 months ago
Bit-Sliced Index Arithmetic
The bit-sliced index (BSI) was originally defined in [ONQ97]. The current paper introduces the concept of BSI arithmetic. For any two BSI's X and Y on a table T, we show how ...
Denis Rinfret, Patrick E. O'Neil, Elizabeth J. O'N...
CATS
2008
13 years 10 months ago
Tractable Cases of the Extended Global Cardinality Constraint
We study the consistency problem for extended global cardinality (EGC) constraints. An EGC constraint consists of a set X of variables, a set D of values, a domain D(x) D for eac...
Marko Samer, Stefan Szeider