16843 search results - page 310 / 3369 » On Generalized Authorization Problems |
196
click to vote
ESA
2005
Springer
16 years 4 days ago
2005
Springer
We study a wide range of online covering and packing optimization problems. In an online covering problem a linear cost function is known in advance, but the linear constraints th...
205
click to vote
WSNA
2003
ACM
15 years 12 months ago
2003
ACM
One fundamental issue in sensor networks is the coverage problem, which reflects how well a sensor network is monitored or tracked by sensors. In this paper, we formulate this pr...
161
click to vote
CPM
1999
Springer
15 years 11 months ago
1999
Springer
We focus on the combinatorial analysis of physical mapping with repeated probes. We present computational complexity results, and we describe and analyze an algorithmic strategy. W...
154
click to vote
CANDC
2009
ACM
16 years 1 months ago
2009
ACM
As part of a larger team developing collaborations between computing and the arts, the co-authors created a general education undergraduate course, Tangible Interaction Design. We...
213
click to vote
WAOA
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We consider the train delivery problem which is a generalization of the bin packing problem and is equivalent to a one dimensional version of the vehicle routing problem ...