Sciweavers

16091 search results - page 371 / 3219
» Solving
Sort
View
USITS
2003
15 years 8 months ago
Network-Sensitive Service Discovery
We consider the problem of network-sensitive service selection (NSSS): finding services that match a particular set of functional and network properties. Current solutions handle...
An-Cheng Huang, Peter Steenkiste
AAAI
1992
15 years 7 months ago
On the Minimality and Decomposability of Constraint Networks
Constraint networks have been shown to be useful in formulating such diverse problems as scene labeling, natural language parsing, and temporal reasoning. Given a constraint netwo...
Peter van Beek
IJCAI
1989
15 years 7 months ago
Utilization Filtering: A Method for Reducing the Inherent Harmfulness of Deductively Learned Knowledge
This paper highlights a phenomenon that causes deductively learned knowledge to be harmful when used for problem solving. The problem occurs when deductive problem solvers encount...
Shaul Markovitch, Paul D. Scott
IJCAI
1989
15 years 7 months ago
Selective Learning of Macro-operators with Perfect Causality
A macro-operator is an integrated operator consisting of plural primitive operators and enables a problem solver to solve more efficiently. However, if a learning system generates...
Seiji Yamada, Sabinro Tsuji
SODA
1990
ACM
114views Algorithms» more  SODA 1990»
15 years 7 months ago
Finding Steiner Forests in Planar Graphs
Given an unweighted planar graph G together with nets of terminals, our problem is to find a Steiner forest, i.e., vertex-disjoint trees, each of which interconnects all the termin...
Hitoshi Suzuki, Takehiro Akama, Takao Nishizeki