256 search results - page 8 / 52 » A Unified Approach to Approximating Partial Covering Problem... |
FOCS
2003
IEEE
14 years 25 days ago
2003
IEEE
A directed multigraph is said to be d-regular if the indegree and outdegree of every vertex is exactly d. By Hall’s theorem one can represent such a multigraph as a combination ...
AI
2006
Springer
13 years 11 months ago
2006
Springer
Real world multiagent coordination problems are important issues for reinforcement learning techniques. In general, these problems are partially observable and this characteristic ...
EDBT
2008
ACM
14 years 7 months ago
2008
ACM
Data Stream Management Systems (DSMSs) must support optimized execution scheduling of multiple continuous queries on massive, and frequently bursty, data streams. Previous approac...
LCN
2005
IEEE
14 years 1 months ago
2005
IEEE
— Recent advances in microelectronic technology have made it possible to construct compact and inexpensive wireless sensors. Sensor networks have received significant attention ...
ICALP
2011
Springer
12 years 11 months ago
2011
Springer
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...