Sciweavers

13987 search results - page 553 / 2798
» The Two Guards Problem
Sort
View
PPSN
2004
Springer
16 years 16 days ago
Intransitivity in Coevolution
Abstract. We review and investigate the current status of intransitivity as a potential obstacle in coevolution. Pareto-Coevolution avoids intransitivity by translating any standar...
Edwin D. de Jong
TCS
2010
15 years 5 months ago
Clustering with partial information
The Correlation Clustering problem, also known as the Cluster Editing problem, seeks to edit a given graph by adding and deleting edges to obtain a collection of disconnected cliq...
Hans L. Bodlaender, Michael R. Fellows, Pinar Hegg...
ICCAD
2002
IEEE
92views Hardware» more  ICCAD 2002»
16 years 4 months ago
ECO algorithms for removing overlaps between power rails and signal wires
Design ECO commonly happens in industry due to constraints or target changes from manufacturing, marketing, reliability, or performance. At each step, designers usually want to mo...
Hua Xiang, Kai-Yuan Chao, D. F. Wong
IMC
2003
ACM
16 years 13 days ago
Best-path vs. multi-path overlay routing
Time-varying congestion on Internet paths and failures due to software, hardware, and configuration errors often disrupt packet delivery on the Internet. Many aproaches to avoidi...
David G. Andersen, Alex C. Snoeren, Hari Balakrish...
SDM
2008
SIAM
147views Data Mining» more  SDM 2008»
15 years 8 months ago
The Asymmetric Approximate Anytime Join: A New Primitive with Applications to Data Mining
It has long been noted that many data mining algorithms can be built on top of join algorithms. This has lead to a wealth of recent work on efficiently supporting such joins with ...
Lexiang Ye, Xiaoyue Wang, Dragomir Yankov, Eamonn ...