Sciweavers

16404 search results - page 345 / 3281
» A set coverage problem
Sort
View
COR
2010
150views more  COR 2010»
15 years 5 months ago
Black box scatter search for general classes of binary optimization problems
The purpose of this paper is to apply the scatter search methodology to general classes of binary problems. We focus on optimization problems for which the solutions are represent...
Francisco Gortázar, Abraham Duarte, Manuel ...
134
Voted
CORR
2008
Springer
90views Education» more  CORR 2008»
15 years 5 months ago
A Pseudo-Boolean Solution to the Maximum Quartet Consistency Problem
Determining the evolutionary history of a given biological data is an important task in biological sciences. Given a set of quartet topologies over a set of taxa, the Maximum Quart...
António Morgado, João P. Marques Sil...
166
Voted
CORR
2011
Springer
202views Education» more  CORR 2011»
14 years 12 months ago
Online Least Squares Estimation with Self-Normalized Processes: An Application to Bandit Problems
The analysis of online least squares estimation is at the heart of many stochastic sequential decision-making problems. We employ tools from the self-normalized processes to provi...
Yasin Abbasi-Yadkori, Dávid Pál, Csa...
DIAGRAMS
2004
Springer
15 years 10 months ago
An Architecture for Problem Solving with Diagrams
In problem solving a goal/subgoal is either solved by generating needed information from current information, or further decomposed into additional subgoals. In traditional problem...
B. Chandrasekaran, Unmesh Kurup, Bonny Banerjee, J...
IJCAI
2003
15 years 6 months ago
Amalgams of Constraint Satisfaction Problems
Many of standard practical techniques of solving constraint satisfaction problems use various decomposition methods to represent a problem as a combination of smaller ones. We stu...
Andrei A. Bulatov, Evgeny S. Skvortsov