4524 search results - page 204 / 905 » The Complexity of Global Constraints |
134
click to vote
COMCOM
2006
15 years 6 months ago
2006
In this paper, for the purpose of saving network resources, we first introduce and investigate a new problem referred to as the least hop(s) multiple additively constrained path (...
150
click to vote
ORL
2008
15 years 6 months ago
2008
We consider the problem to sell items to a set of bidders. Bidders bid on bundles of items, and each item's availability is unbounded, like for digital goods. We need to dete...
163
click to vote
MICCAI
2010
Springer
15 years 5 months ago
2010
Springer
International Conference on Medical Image Computing and Computer Assisted Intervention, Beijing, China, 20-24 September 2010 Extracting numerous cells in a large microscopic image...
206
click to vote
JSAC
2011
14 years 9 months ago
2011
—This paper studies the problem of scheduling in single-hop wireless networks with real-time traffic, where every packet arrival has an associated deadline and a minimum fractio...
273
click to vote
ICDE
2003
IEEE
16 years 8 months ago
2003
IEEE
We present a technique for refining the design of relational storage for XML data based on XML key propagation. Three algorithms are presented: one checks whether a given function...