Sciweavers

1568 search results - page 132 / 314
» The problem of examination questions in algorithmics
Sort
View
115
Voted
AIPS
2010
15 years 7 months ago
The More, the Merrier: Combining Heuristic Estimators for Satisficing Planning
The problem of effectively combining multiple heuristic estimators has been studied extensively in the context of optimal planning, but not in the context of satisficing planning....
Gabriele Röger, Malte Helmert
ACL
2007
15 years 6 months ago
Optimizing Grammars for Minimum Dependency Length
We examine the problem of choosing word order for a set of dependency trees so as to minimize total dependency length. We present an algorithm for computing the optimal layout of ...
Daniel Gildea, David Temperley
145
Voted
CNIS
2006
15 years 6 months ago
Self-organising quorum systems for ad hoc networks
There are many essential applications for quorum systems in ad-hoc networks, such as that of location servers in large-scale networks. Existing research proposes many approaches t...
Gareth Owen, Mo Adda
138
Voted
NETWORKING
2004
15 years 6 months ago
A New Method of Primary Routes Selection for Local Restoration
We consider the problem of non-bifurcated multicommodity flows rerouting in survivable connection-oriented networks. We focus on local restoration, in which the backup route is rer...
Krzysztof Walkowiak
131
Voted
WSC
2001
15 years 6 months ago
Global random optimization by simultaneous perturbation stochastic approximation
We examine the theoretical and numerical global convergence properties of a certain "gradient free" stochastic approximation algorithm called the "simultaneous pertu...
John L. Maryak, Daniel C. Chin