1732 search results - page 77 / 347 » New Challenges in Parallel Optimization |
TBILLC
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. In this paper, we present a game theoretic account of a subclass of ‘relevance’ implicatures arising from irrelevant answers. We show that these phenomena can be expl...
MST
2002
13 years 7 months ago
2002
Abstract. Blockwise access to data is a central theme in the design of efficient external memory (EM) algorithms. A second important issue, when more than one disk is present, is f...
ARTDB
1997
Springer
14 years 6 days ago
1997
Springer
This paper proposes a strategy for parallel composite event detection in Active database systems (DBS). Up to now, the detection is sequential and totally synchronized, and thus p...
GECCO
2007
Springer
14 years 2 months ago
2007
Springer
The Cross Entropy algorithm is a new search method for combinatorial problem. However, it needs considerable computational time to achieve good solution quality. To make the Cross...
SPAA
2006
ACM
14 years 2 months ago
2006
ACM
Tree contraction algorithms, whose idea was first proposed by Miller and Reif, are important parallel algorithms to implement efficient parallel programs manipulating trees. Desp...