Sciweavers

350 search results - page 14 / 70
» Separation of Partition Inequalities
Sort
View
EC
2008
153views ECommerce» more  EC 2008»
13 years 7 months ago
On Complexity of Optimal Recombination for Binary Representations of Solutions
We consider an optimization problem of finding the best possible offspring as a result of a recombination operator in an evolutionary algorithm, given two parent solutions. The op...
Anton V. Eremeev
CHI
2003
ACM
14 years 8 months ago
Partitioning cursor movements in "point and click" tasks
Studies of cursor trajectories can help explain performance differences in "point and click" tasks. As users can have different difficulties with moving the cursor to a ...
Faustina Hwang
CORR
2010
Springer
109views Education» more  CORR 2010»
13 years 8 months ago
Pairwise Optimal Discrete Coverage Control for Gossiping Robots
Abstract-- We propose distributed algorithms to automatically deploy a group of robotic agents and provide coverage of a discretized environment represented by a graph. The classic...
Joseph W. Durham, Ruggero Carli, Francesco Bullo
BROADNETS
2007
IEEE
14 years 2 months ago
Strategic deployment of network monitors for attack attribution
—Attacks launched over the Internet have become a pressing problem. Attackers make use of a variety of techniques to anonymize their traffic, in order to escape detection and pr...
Young June Pyun, Douglas S. Reeves
WONS
2005
IEEE
14 years 1 months ago
A Partition Prediction Algorithm for Service Replication in Mobile Ad Hoc Networks
Due to the mobility of nodes in Ad hoc networks, network topology is dynamic and unpredictable, which leads to frequent network partitioning. This partitioning disconnects many no...
Abdelouahid Derhab, Nadjib Badache, Abdelmadjid Bo...