Sciweavers

8582 search results - page 1712 / 1717
» Here or There
Sort
View
WSE
2003
IEEE
14 years 24 days ago
Resolution of Static Clones in Dynamic Web Pages
Cloning is extremely likely to occur in web sites, much more so than in other software. While some clones exist for valid reasons, or are too small to eliminate, cloning percentag...
Nikita Synytskyy, James R. Cordy, Thomas R. Dean
DIALM
2003
ACM
175views Algorithms» more  DIALM 2003»
14 years 24 days ago
Localized construction of bounded degree and planar spanner for wireless ad hoc networks
We propose a novel localized algorithm that constructs a bounded degree and planar spanner for wireless ad hoc networks modeled by unit disk graph (UDG). Every node only has to kn...
Yu Wang 0003, Xiang-Yang Li
GECCO
2003
Springer
201views Optimization» more  GECCO 2003»
14 years 23 days ago
Solving Mastermind Using Genetic Algorithms
The MasterMind game involves decoding a secret code. The classic game is a code of six possible colors in four slots. The game has been analyzed and optimal strategies have been po...
Tom Kalisker, Doug Camens
SPAA
2010
ACM
14 years 11 days ago
Tree network coding for peer-to-peer networks
Partitioning is the dominant technique to transmit large files in peer-to-peer networks. A peer can redistribute each part immediately after its download. BitTorrent combines thi...
Arne Vater, Christian Schindelhauer, Christian Ort...
FOCS
2004
IEEE
13 years 11 months ago
Optimal Inapproximability Results for Max-Cut and Other 2-Variable CSPs?
In this paper we show a reduction from the Unique Games problem to the problem of approximating MAX-CUT to within a factor of GW + , for all > 0; here GW .878567 denotes the a...
Subhash Khot, Guy Kindler, Elchanan Mossel, Ryan O...
« Prev « First page 1712 / 1717 Last » Next »