2496 search results - page 43 / 500 » On covering by translates of a set |
ISSTA
2004
ACM
15 years 5 months ago
2004
ACM
—Many modern software systems are designed to be highly configurable so they can run on and be optimized for a wide variety of platforms and usage scenarios. Testing such systems...
AIIDE
2008
15 years 2 months ago
2008
We explore the task of designing an efficient multi-agent system that is capable of capturing a single moving target, assuming that every agent knows the location of all agents on...
ISMVL
2009
IEEE
15 years 6 months ago
2009
IEEE
A partial function f on an k-element set Ek is a partial Sheffer function if every partial function on Ek is definable in terms of f. Since this holds if and only if f belongs to...
159
click to vote
ICML
2006
IEEE
15 years 8 months ago
2006
IEEE
We present a tree data structure for fast
nearest neighbor operations in general n-
point metric spaces (where the data set con-
sists of n points). The data structure re-
quir...
TIT
2008
14 years 11 months ago
2008
The identifying code problem for a given graph involves finding a minimum set of vertices whose neighborhoods uniquely overlap at any given graph vertex. Initially introduced in 1...