Sciweavers

1363 search results - page 168 / 273
» The road coloring problem
Sort
View
COMPGEOM
1999
ACM
15 years 10 months ago
Folding Flat Silhouettes and Wrapping Polyhedral Packages: New Results in Computational Origami
We show a remarkable fact about folding paper: From a single rectangular sheet of paper, one can fold it into a flat origami that takes the (scaled) shape of any connected polygo...
Erik D. Demaine, Martin L. Demaine, Joseph S. B. M...
GECCO
2006
Springer
191views Optimization» more  GECCO 2006»
15 years 10 months ago
The Brueckner network: an immobile sorting swarm
In many industrial applications, the dynamic control of queuing and routing presents difficult challenges. We describe a novel ant colony control system for a multiobjective sorti...
William A. Tozier, Michael R. Chesher, Tejinderpal...
ALGORITHMICA
2010
143views more  ALGORITHMICA 2010»
15 years 6 months ago
Absolute and Asymptotic Bounds for Online Frequency Allocation in Cellular Networks
Given a cellular (mobile telephone) network, whose geographical coverage area is divided into hexagonal cells, phone calls are serviced by assigning frequencies to them so that no...
Joseph Wun-Tat Chan, Francis Y. L. Chin, Deshi Ye,...
DC
2010
15 years 6 months ago
An optimal maximal independent set algorithm for bounded-independence graphs
We present a novel distributed algorithm for the maximal independent set (MIS) problem.1 On bounded-independence graphs (BIG) our deterministic algorithm finishes in O(log n) time,...
Johannes Schneider, Roger Wattenhofer
INTERNET
2006
149views more  INTERNET 2006»
15 years 6 months ago
Concurrent Multiple-Issue Negotiation for Internet-Based Services
Negotiation is a technique for reaching mutually beneficial agreement among autonomous entities. A concurrent negotiation problem occurs when one entity is negotiating simultaneous...
Jiangbo Dang, Michael N. Huhns