Sciweavers

14165 search results - page 359 / 2833
» The generalized two-server problem
Sort
View
238
Voted
TASE
2010
IEEE
15 years 1 months ago
Coverage of a Planar Point Set With Multiple Robots Subject to Geometric Constraints
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
Nilanjan Chakraborty, Srinivas Akella, John T. Wen
SODA
2012
ACM
226views Algorithms» more  SODA 2012»
13 years 9 months ago
On the hardness of pricing loss-leaders
Consider the problem of pricing n items under an unlimited supply with m buyers. Each buyer is interested in a bundle of at most k of the items. These buyers are single minded, wh...
Preyas Popat, Yi Wu
EDBT
2012
ACM
257views Database» more  EDBT 2012»
13 years 9 months ago
Indexing and mining topological patterns for drug discovery
Increased availability of large repositories of chemical compounds has created new challenges and opportunities for the application of data-mining and indexing techniques to probl...
Sayan Ranu, Ambuj K. Singh
178
Voted
SIGCSE
2004
ACM
628views Education» more  SIGCSE 2004»
16 years 4 days ago
Design patterns for semaphores
This paper describes two design patterns that are powerful tools to help teach how semaphores are used to solve synchronization problems. The patterns are general enough to be use...
Kenneth A. Reek
ISPD
1998
ACM
88views Hardware» more  ISPD 1998»
15 years 11 months ago
An efficient technique for device and interconnect optimization in deep submicron designs
In this paper, we formulate a new class of optimization problem, named the general CH-posynomial program, and reveal the general dominance property. We propose an efcient algorith...
Jason Cong, Lei He