Sciweavers

1995 search results - page 13 / 399
» What's the Problem
Sort
View
IAT
2010
IEEE
13 years 5 months ago
Getting What You Pay For: Is Exploration in Distributed Hill Climbing Really Worth it?
Abstract--The Distributed Stochastic Algorithm (DSA), Distributed Breakout Algorithm (DBA), and variations such as Distributed Simulated Annealing (DSAN), MGM-1, and DisPeL, are di...
Melanie Smith, Roger Mailler
AI
2008
Springer
13 years 7 months ago
What makes propositional abduction tractable
Abduction is a fundamental form of nonmonotonic reasoning that aims at finding explanations for observed manifestations. This process underlies many applications, from car configu...
Gustav Nordh, Bruno Zanuttini
CEC
2008
IEEE
14 years 1 months ago
Learning what to ignore: Memetic climbing in topology and weight space
— We present the memetic climber, a simple search algorithm that learns topology and weights of neural networks on different time scales. When applied to the problem of learning ...
Julian Togelius, Faustino J. Gomez, Jürgen Sc...
DAWAK
2007
Springer
14 years 1 months ago
What-If Analysis for Data Warehouse Evolution
In this paper, we deal with the problem of performing what-if analysis for changes that occur in the schema/structure of the data warehouse We abstract software modules, queries, r...
George Papastefanatos, Panos Vassiliadis, Alkis Si...
ECCV
2010
Springer
14 years 16 days ago
Learning What and How of Contextual Models for Scene Labeling
We present a data-driven approach to predict the importance of edges and construct a Markov network for image analysis based on statistical models of global and local image feature...