Sciweavers

1258 search results - page 48 / 252
» Architecture-driven Problem Decomposition
Sort
View
IJCAI
2003
13 years 10 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
LICS
2009
IEEE
14 years 3 months ago
The General Vector Addition System Reachability Problem by Presburger Inductive Invariants
The reachability problem for Vector Addition Systems (VASs) is a central problem of net theory. The general problem is known decidable by algorithms exclusively based on the class...
Jérôme Leroux
GECCO
2009
Springer
147views Optimization» more  GECCO 2009»
14 years 3 months ago
Evolutionary algorithms and multi-objectivization for the travelling salesman problem
This paper studies the multi-objectivization of single-objective optimization problems (SOOP) using evolutionary multi-objective algorithms (EMOAs). In contrast to the single-obje...
Martin Jähne, Xiaodong Li, Jürgen Branke
ALGORITHMICA
2006
77views more  ALGORITHMICA 2006»
13 years 9 months ago
Scalable Parallel Algorithms for FPT Problems
Algorithmic methods based on the theory of fixed-parameter tractability are combined with powerful computational platforms to launch systematic attacks on combinatorial problems o...
Faisal N. Abu-Khzam, Michael A. Langston, Pushkar ...
ICML
2005
IEEE
14 years 10 months ago
Weighted decomposition kernels
We introduce a family of kernels on discrete data structures within the general class of decomposition kernels. A weighted decomposition kernel (WDK) is computed by dividing objec...
Sauro Menchetti, Fabrizio Costa, Paolo Frasconi