Sciweavers

1995 search results - page 107 / 399
» What's the Problem
Sort
View
EATCS
2000
85views more  EATCS 2000»
15 years 3 months ago
A New Zero-One Law and Strong Extension Axioms
One of the previous articles in this column was devoted to the zero-one laws for a number of logics playing prominent role in finite model theory: first-order logic FO, the extens...
Andreas Blass, Yuri Gurevich
IJCAI
2003
15 years 5 months ago
Backdoors To Typical Case Complexity
There has been significant recent progress in reasoning and constraint processing methods. In areas such as planning and finite model-checking, current solution techniques can h...
Ryan Williams, Carla P. Gomes, Bart Selman
CN
1998
95views more  CN 1998»
15 years 3 months ago
The Limits of Web Metadata, and Beyond
The World Wide Web currently has a huge amount of data, with practically no classification information, and this makes it extremely difficult to handle effectively. It has been re...
Massimo Marchiori
GECCO
1999
Springer
15 years 8 months ago
A parameter-less genetic algorithm
From the user’s point of view, setting the parameters of a genetic algorithm (GA) is far from a trivial task. Moreover, the user is typically not interested in population sizes,...
Georges R. Harik, Fernando G. Lobo
110
Voted
STACS
2000
Springer
15 years 7 months ago
The Complexity of Poor Man's Logic
Motivated by description logics, we investigate what happens to the complexity of modal satisfiability problems if we only allow formulas built from literals, , 3, and 2. Previous...
Edith Hemaspaandra