16504 search results - page 95 / 3301 » New Problems, New Solutions |
158
click to vote
IPPS
2003
IEEE
15 years 11 months ago
2003
IEEE
Graphic cards performance increase and fast Internet connections are popularising Networked Virtual Environments. This immature paradigm of real-time applications has still to sol...
149
click to vote
INFOVIS
2000
IEEE
15 years 10 months ago
2000
IEEE
COMIND is a tool for conceptual design of industrial products. It helps designers define and evaluate the initial design space by using search algorithms to generate sets of feasi...
199
click to vote
IICAI
2003
15 years 7 months ago
2003
Minimum vertex cover problem (MVCP) is an NP-hard problem and it has numerous real life applications. This paper presents hybrid genetic algorithm (HGA) to solve MVCP efficiently. ...
152
click to vote
EOR
2010
15 years 6 months ago
2010
This paper presents a hybrid metaheuristic approach (HMA) for solving the Unconstrained Binary Quadratic Programming (UBQP) problem. By incorporating a tabu search procedure into ...
140
click to vote
CORR
2002
Springer
15 years 6 months ago
2002
Springer
We introduce a general and in a certain sense time-optimal way of solving one problem after another, efficiently searching the space of programs that compute solution candidates, i...