Sciweavers

2137 search results - page 386 / 428
» Approximation Algorithms for Some Graph Partitioning Problem...
Sort
View
COMCOM
2010
276views more  COMCOM 2010»
15 years 2 months ago
Adjustable convergecast tree protocol for wireless sensor networks
For data-collection applications in sensor networks, it is important to ensure base station receives a complete picture about the monitored area. Convergecast is an important commu...
Tzung-Shi Chen, Hua-Wen Tsai, Chih-Ping Chu
EOR
2007
117views more  EOR 2007»
15 years 1 months ago
Considering manufacturing cost and scheduling performance on a CNC turning machine
A well known industry application that allows controllable processing times is the manufacturing operations on CNC machines. For each turning operation as an example, there is a n...
Sinan Gurel, M. Selim Akturk
130
Voted
ADHOCNOW
2010
Springer
15 years 1 hour ago
On Minimizing the Sum of Sensor Movements for Barrier Coverage of a Line Segment
A set of sensors establishes barrier coverage of a given line segment if every point of the segment is within the sensing range of a sensor. Given a line segment I, n mobile sensor...
Jurek Czyzowicz, Evangelos Kranakis, Danny Krizanc...
GECCO
2006
Springer
167views Optimization» more  GECCO 2006»
15 years 5 months ago
Estimating the destructiveness of crossover on binary tree representations
In some cases, evolutionary algorithms represent individuals as typical binary trees with n leaves and n-1 internal nodes. When designing a crossover operator for a particular rep...
Luke Sheneman, James A. Foster
IJRR
2008
115views more  IJRR 2008»
15 years 1 months ago
Planning High-quality Paths and Corridors Amidst Obstacles
The motion-planning problem, involving the computation of a collision-free path for a moving entity amidst obstacles, is a central problem in fields like Robotics and Game Design....
Ron Wein, Jur P. van den Berg, Dan Halperin