16091 search results - page 359 / 3219 » Solving |
191
click to vote
GECCO
2009
Springer
15 years 11 months ago
2009
Springer
The Vehicle Routing Problem can be seen as a fusion of two well known combinatorial problems, the Travelling Salesman Problem and Bin Packing Problem. It has several variants, the...
174
click to vote
GECCO
2009
Springer
15 years 11 months ago
2009
Springer
The Vehicle Routing Problem’s main objective is to find the lowest-cost set of routes to deliver goods to customers, which have a service time window, using a fleet of identic...
156
click to vote
GI
2009
Springer
15 years 11 months ago
2009
Springer
: Serious games are defined as games with a purpose. These games serve a purpose beyond play in difference to games, whose purpose is nothing than the play activity itself. Human C...
175
Voted
DNA
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. The goal of this research is to improve the programmability of DNA-based computers. Novel clockable microreactors can be connected in various ways to solve combinatorial ...
177
click to vote
DATE
2000
IEEE
15 years 11 months ago
2000
IEEE
The Boolean satisfiability problem (SAT) has various applications in electronic design automation (EDA) fields such as testing, timing analysis and logic verification. SAT has bee...