3422 search results - page 218 / 685 » Random Subset Optimization |
183
Voted
RECOMB
2009
Springer
16 years 1 months ago
2009
Springer
In genome rearrangements, the double cut and join (DCJ) operation, introduced by Yancopoulos et al., allows to represent most rearrangement events that could happen in multichromos...
161
click to vote
IROS
2009
IEEE
16 years 1 months ago
2009
IEEE
Abstract— Optimal motions are usually used as joint reference trajectories for repetitive or complex motions. In the case of soccer robots, the kicking motion is usually a benchm...
136
click to vote
DATE
2006
IEEE
16 years 13 days ago
2006
IEEE
This paper presents an efficient method to find the optimal intra-task voltage/frequency scheduling for single tasks in practical real-time systems using statistical workload in...
180
click to vote
CP
2003
Springer
15 years 11 months ago
2003
Springer
This paper aims to show that Constraint Programming can be an efficient technique to solve a well-known combinatorial optimization problem: the search for a maximum clique in a gra...
186
click to vote
EPS
1998
Springer
15 years 10 months ago
1998
Springer
This paper reports work investigating various evolutionary approaches to vertex cover (VC), a well-known NP-Hard optimization problem. Central to each of the algorithms is a novel ...