Sciweavers

14518 search results - page 302 / 2904
» Two Problems for Sophistication
Sort
View
ACL
2008
15 years 8 months ago
Solving Relational Similarity Problems Using the Web as a Corpus
We present a simple linguistically-motivated method for characterizing the semantic relations that hold between two nouns. The approach leverages the vast size of the Web in order...
Preslav Nakov, Marti A. Hearst
172
Voted
AAAI
2006
15 years 8 months ago
Tractable Classes of Metric Temporal Problems with Domain Rules
In this paper, we will deal with some important kinds of metric temporal reasoning problems that arise in many real-life situations. In particular, events X0, X1 . . . XN are mode...
T. K. Satish Kumar
ICGA
1993
296views Optimization» more  ICGA 1993»
15 years 8 months ago
A Genetic Algorithm Applied to the Maximum Flow Problem
A genetic algorithms is applied to find a maximum flow from the source to sink in a weighted directed graph, where the weight associated with each edge represents its flow capacit...
Toshinori Munakata, David J. Hashier
IJCAI
1989
15 years 7 months ago
A Study of Empirical Learning for an Involved Problem
In real-world domains a concept to be learned may be unwieldy and the environment may be less than ideal. One combination of difficulties occurs if the concept is probabilistic an...
Larry A. Rendell
COR
2010
164views more  COR 2010»
15 years 6 months ago
The distributed permutation flowshop scheduling problem
This paper studies a new generalization of the regular permutation flowshop scheduling problem (PFSP) referred to as the distributed permutation flowshop scheduling problem or DPF...
B. Naderi, Rubén Ruiz