Sciweavers

7930 search results - page 337 / 1586
» Greedy in Approximation Algorithms
Sort
View
ICDM
2008
IEEE
99views Data Mining» more  ICDM 2008»
16 years 1 months ago
Finding Good Itemsets by Packing Data
The problem of selecting small groups of itemsets that represent the data well has recently gained a lot of attention. We approach the problem by searching for the itemsets that c...
Nikolaj Tatti, Jilles Vreeken
ICDCS
2006
IEEE
16 years 22 days ago
Utility Optimization for Event-Driven Distributed Infrastructures
Event-driven distributed infrastructures are becoming increasingly important for information dissemination and application integration. We examine the problem of optimal resource ...
Cristian Lumezanu, Sumeer Bhola, Mark Astley
ICS
1999
Tsinghua U.
15 years 11 months ago
Reorganizing global schedules for register allocation
Instruction scheduling is an important compiler technique for exploiting more instruction-level parallelism (ILP) in high-performance microprocessors, and in this paper, we study ...
Gang Chen, Michael D. Smith
ADHOCNOW
2009
Springer
15 years 7 months ago
Localized Sensor Self-deployment with Coverage Guarantee in Complex Environment
Abstract. In focused coverage problem, sensors are required to be deployed around a given point of interest (POI) with respect to a priority requirement: an area close to POI has h...
Xu Li, Nathalie Mitton, Isabelle Ryl, David Simplo...
GECON
2008
Springer
152views Business» more  GECON 2008»
15 years 7 months ago
The Power of Preemption in Economic Online Markets
Abstract. In distributed computer networks where resources are under decentralized control, selfish users will generally not work towards one common goal, such as maximizing the o...
Lior Amar, Ahuva Mu'alem, Jochen Stößer