Sciweavers

Share
IANDC
1998
64views more  IANDC 1998»
8 years 11 months ago
Positive Versions of Polynomial Time
We show that restricting a number of characterizations of the complexity class P to be positive (in natural ways) results in the same class of (monotone) problems which we denote ...
Clemens Lautemann, Thomas Schwentick, Iain A. Stew...
JAIR
2002
95views more  JAIR 2002»
8 years 11 months ago
A Critical Assessment of Benchmark Comparison in Planning
Recent trends in planning research have led to empirical comparison becoming commonplace. The eld has started to settle into a methodology for such comparisons, which for obvious ...
Adele E. Howe, Eric Dahlman
IOR
2002
179views more  IOR 2002»
8 years 11 months ago
Decision Analysis: A Personal Account of How It Got Started and Evolved
Then these analytically motivated abstractions were gradually made more intricate as the body of mathematical techniques grew. The trend went from elementary analysis of complex, i...
Howard Raiffa
DATAMINE
1998
126views more  DATAMINE 1998»
8 years 11 months ago
An Extension to SQL for Mining Association Rules
Data mining evolved as a collection of applicative problems and efficient solution algorithms relative to rather peculiar problems, all focused on the discovery of relevant infor...
Rosa Meo, Giuseppe Psaila, Stefano Ceri
CSL
1998
Springer
8 years 11 months ago
Evaluation in the context of natural language generation
What role should evaluation play in the development of natural language generation () techniques and systems? In this paper we describe what is involved in natural langua...
Chris Mellish, R. Dale
IJAIT
2002
81views more  IJAIT 2002»
8 years 11 months ago
Guiding Constructive Search with Statistical Instance-Based Learning
Several real world applications involve solving combinatorial optimization problems. Commonly, existing heuristic approaches are designed to address specific difficulties of the u...
Orestis Telelis, Panagiotis Stamatopoulos
SIAMCOMP
2000
97views more  SIAMCOMP 2000»
8 years 11 months ago
Complexity of Some Problems Concerning Varieties and Quasi-Varieties of Algebras
In this paper we consider the complexity of several problems involving finite algebraic structures. Given finite algebras A and B, these problems ask the following. (1) Do A and B ...
Clifford Bergman, Giora Slutzki
GEOINFORMATICA
2002
92views more  GEOINFORMATICA 2002»
8 years 11 months ago
Using Genetic Algorithms for Solving Hard Problems in GIS
Genetic algorithms (GAs) are powerful combinatorial optimizers that are able to
Steven van Dijk, Dirk Thierens, Mark de Berg
PAMI
2000
142views more  PAMI 2000»
8 years 11 months ago
Automatic Analysis of Facial Expressions: The State of the Art
Maja Pantic, Léon J. M. Rothkrantz
FGCS
2002
133views more  FGCS 2002»
8 years 11 months ago
Computational and data Grids in large-scale science and engineering
As the practice of science moves beyond the single investigator due to the complexity of the problems that now dominate science, large collaborative and multi-institutional teams ...
William E. Johnston
books