Sciweavers

3406 search results - page 268 / 682
» General Search Algorithms for Energy Minimization Problems
Sort
View
MSWIM
2003
ACM
16 years 23 hour ago
Flooding strategy for target discovery in wireless networks
In this paper, we address a fundamental problem concerning the best flooding strategy to minimize cost and latency for target discovery in wireless networks. Should we flood the ...
Zhao Cheng, Wendi Beth Heinzelman
ICDM
2003
IEEE
130views Data Mining» more  ICDM 2003»
16 years 2 days ago
Information Theoretic Clustering of Sparse Co-Occurrence Data
A novel approach to clustering co-occurrence data poses it as an optimization problem in information theory which minimizes the resulting loss in mutual information. A divisive cl...
Inderjit S. Dhillon, Yuqiang Guan
GECCO
2006
Springer
265views Optimization» more  GECCO 2006»
15 years 10 months ago
Cutting stock waste reduction using genetic algorithms
A new model for the One-dimensional Cutting Stock problem using Genetic Algorithms (GA) is developed to optimize construction steel bars waste. One-dimensional construction stocks...
Yaser M. A. Khalifa, O. Salem, A. Shahin
ALGORITHMICA
2007
118views more  ALGORITHMICA 2007»
15 years 7 months ago
External-Memory Algorithms for Processing Line Segments in Geographic Information Systems
d abstract) Lars Arge1 , Darren Erik Vengroff2 , and Jeffrey Scott Vitter3 1 BRICS† , Department of Computer Science, University of Aarhus, Aarhus, Denmark 2 Department of Comp...
Lars Arge, Darren Erik Vengroff, Jeffrey Scott Vit...
COMPGEOM
2003
ACM
16 years 1 days ago
Cache-oblivious data structures for orthogonal range searching
We develop cache-oblivious data structures for orthogonal range searching, the problem of finding all T points in a set of N points in Êd lying in a query hyper-rectangle. Cache...
Pankaj K. Agarwal, Lars Arge, Andrew Danner, Bryan...