Sciweavers

1940 search results - page 19 / 388
» Search with Synonyms: Problems and Solutions
Sort
View
AUSAI
1999
Springer
15 years 10 months ago
Applying Ant Algorithms and the No Fit Polygon to the Nesting Problem
In previous work solutions for the nesting problem are produced using the no fit polygon (NFP), a new evaluation method and three evolutionary algorithms (simulated annealing (SA),...
Edmund K. Burke, Graham Kendall
CEC
2009
IEEE
16 years 27 days ago
Improved memetic algorithm for Capacitated Arc Routing Problem
— Capacitated Arc Routing Problem (CARP) has attracted much interest because of its wide applications in the real world. Recently, a memetic algorithm proposed by Lacomme et al. ...
Yi Mei, Ke Tang, Xin Yao
CG
1998
Springer
15 years 10 months ago
A Survey of Tsume-Shogi Programs Using Variable-Depth Search
Recently, a number of programs have been developed that successfully apply variable-depth search to find solutions for mating problems in Japanese chess, called tsume shogi. Public...
Reijer Grimbergen
CPAIOR
2004
Springer
15 years 11 months ago
Super Solutions in Constraint Programming
To improve solution robustness, we introduce the concept of super solutions to constraint programming. An (a, b)-super solution is one in which if a variables lose their values, th...
Emmanuel Hebrard, Brahim Hnich, Toby Walsh
CRYPTO
2007
Springer
132views Cryptology» more  CRYPTO 2007»
16 years 9 days ago
How Should We Solve Search Problems Privately?
Abstract. Secure multiparty computation allows a group of distrusting parties to jointly compute a (possibly randomized) function of their inputs. However, it is often the case tha...
Amos Beimel, Tal Malkin, Kobbi Nissim, Enav Weinre...