Sciweavers

1568 search results - page 284 / 314
» The problem of examination questions in algorithmics
Sort
View
146
Voted
GECCO
2007
Springer
196views Optimization» more  GECCO 2007»
15 years 10 months ago
Optimal nesting of species for exact cover of resources: two against many
The application of resource-defined fitness sharing (RFS) to shape nesting problems reveals a remarkable ability to discover tilings [7, 8]. These tilings represent exact covers...
Jeffrey Horn
INFOCOM
2003
IEEE
15 years 9 months ago
Exploring the trade-off between label size and stack depth in MPLS Routing
— Multiprotocol Label Switching or MPLS technology is being increasingly deployed by several of the largest Internet service providers to solve problems such as traffic engineer...
Anupam Gupta, Amit Kumar, Rajeev Rastogi
COCO
2010
Springer
153views Algorithms» more  COCO 2010»
15 years 7 months ago
Communication Complexity with Synchronized Clocks
Abstract—We consider two natural extensions of the communication complexity model that are inspired by distributed computing. In both models, two parties are equipped with synchr...
Russell Impagliazzo, Ryan Williams
FAST
2008
15 years 6 months ago
SWEEPER: An Efficient Disaster Recovery Point Identification Mechanism
Data corruption is one of the key problems that is on top of the radar screen of most CIOs. Continuous Data Protection (CDP) technologies help enterprises deal with data corruptio...
Akshat Verma, Kaladhar Voruganti, Ramani Routray, ...
SDM
2004
SIAM
253views Data Mining» more  SDM 2004»
15 years 5 months ago
Density-Connected Subspace Clustering for High-Dimensional Data
Several application domains such as molecular biology and geography produce a tremendous amount of data which can no longer be managed without the help of efficient and effective ...
Peer Kröger, Hans-Peter Kriegel, Karin Kailin...