5316 search results - page 119 / 1064 » Which Search Problems Are Random |
128
click to vote
GECCO
2007
Springer
15 years 9 months ago
2007
Springer
In this paper, a novel discrete differential evolution (DDE) algorithm is presented to solve the permutation flowhop scheduling problem with the makespan criterion. The DDE algori...
128
click to vote
IROS
2008
IEEE
15 years 9 months ago
2008
IEEE
— In this paper, we present a new method that uses random search for online planning of biped walking, given a feasible footstep plan. The Linear Inverted Pendulum dynamic model ...
91
Voted
VISUALIZATION
1996
IEEE
15 years 7 months ago
1996
IEEE
This paper presents a novel approach to assist the user in exploring appropriate transfer functions for the visualization of volumetric datasets. The search for a transfer functio...
136
Voted
DICTA
2003
15 years 4 months ago
2003
Abstract. Texture synthesis aims to define and reproduce discriminating image features. These features are used to associate with and differentiate between two textures. Often tex...
125
Voted
ATAL
2006
Springer
15 years 7 months ago
2006
Springer
We present a new polynomial-space algorithm for solving Distributed Constraint Optimization problems (DCOP). The algorithm, called NCBB, is branch and bound search with modificati...