3690 search results - page 270 / 738 » Computation with classical sequents |
155
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
Classical chess engines exhaustively explore moving possibilities from a chessboard configuration to choose what the next best move to play is. In this article we present a new me...
199
click to vote
LICS
1998
IEEE
15 years 10 months ago
1998
IEEE
Probabilistic I/O automata (PIOA) constitute a model for distributed or concurrent systems that incorporates a notion of probabilistic choice. The PIOA model provides a notion of ...
172
click to vote
RSCTC
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. Classic parsing methods are based on complete search techniques to find the different interpretations of a sentence. However, the size of the search space increases expon...
192
click to vote
GECCO
2010
Springer
15 years 10 months ago
2010
Springer
Most surrogate approaches to multi-objective optimization build a surrogate model for each objective. These surrogates can be used inside a classical Evolutionary Multiobjective O...
210
click to vote
DLOG
2008
15 years 9 months ago
2008
Abstract. Fuzzy Description Logics (f-DLs) have been proposed as extensions of classical Description Logics able to handle imprecise and vague knowledge. Although several extension...