Sciweavers

14548 search results - page 171 / 2910
» The Optimal Path-Matching Problem
Sort
View
SAT
2007
Springer
146views Hardware» more  SAT 2007»
14 years 4 months ago
Algorithms for Variable-Weighted 2-SAT and Dual Problems
Abstract. In this paper we study NP-hard weighted satisfiability optimization problems for the class 2-CNF providing worst-case upper time bounds. Moreover we consider the monoton...
Stefan Porschen, Ewald Speckenmeyer
CORR
2010
Springer
146views Education» more  CORR 2010»
13 years 10 months ago
GRASP for the Coalition Structure Formation Problem
Abstract. The coalition structure formation problem represents an active research area in multi-agent systems. A coalition structure is defined as a partition of the agents involve...
Nicola Di Mauro, Teresa Maria Altomare Basile, Ste...
GECCO
2006
Springer
164views Optimization» more  GECCO 2006»
14 years 2 months ago
A fast hybrid genetic algorithm for the quadratic assignment problem
Genetic algorithms (GAs) have recently become very popular by solving combinatorial optimization problems. In this paper, we propose an extension of the hybrid genetic algorithm f...
Alfonsas Misevicius
ADBIS
2005
Springer
116views Database» more  ADBIS 2005»
14 years 4 months ago
A Formal Model for the Problem of View Selection for Aggregate Queries
We present a formal analysis of the following view-selection problem: Given a set of queries and a database, return definitions of views that, when materialized in the database, w...
Jingni Li, Zohreh Asgharzadeh Talebi, Rada Chirkov...
CP
2007
Springer
14 years 4 months ago
Dealing with Incomplete Preferences in Soft Constraint Problems
We consider soft constraint problems where some of the preferences may be unspecified. This models, for example, situations with several agents providing the data, or with possibl...
Mirco Gelain, Maria Silvia Pini, Francesca Rossi, ...