Sciweavers

1434 search results - page 127 / 287
» Graph Searching with Advice
Sort
View
126
Voted
OPODIS
2008
15 years 4 months ago
Computing and Updating the Process Number in Trees
The process number is the minimum number of requests that have to be simultaneously disturbed during a routing reconfiguration phase of a connection oriented network. From a graph ...
David Coudert, Florian Huc, Dorian Mazauric
119
Voted
ICPR
2002
IEEE
16 years 4 months ago
Metric-Based Shape Retrieval in Large Databases
This paper examines the problem of database organization and retrieval based on computing metric pairwise distances. A low-dimensional Euclidean approximation of a high-dimensiona...
Thomas B. Sebastian, Benjamin B. Kimia
IDEAL
2007
Springer
15 years 9 months ago
PINCoC : A Co-clustering Based Approach to Analyze Protein-Protein Interaction Networks
A novel technique to search for functional modules in a protein-protein interaction network is presented. The network is represented by the adjacency matrix associated with the und...
Clara Pizzuti, Simona E. Rombo
112
Voted
CAEPIA
2007
Springer
15 years 7 months ago
Efficient Pruning of Operators in Planning Domains
Many recent successful planners use domain-independent heuristics to speed up the search for a valid plan. An orthogonal approach to accelerating search is to identify and remove r...
Anders Jonsson
120
Voted
AAAI
2006
15 years 4 months ago
Focused Real-Time Dynamic Programming for MDPs: Squeezing More Out of a Heuristic
Real-time dynamic programming (RTDP) is a heuristic search algorithm for solving MDPs. We present a modified algorithm called Focused RTDP with several improvements. While RTDP ma...
Trey Smith, Reid G. Simmons