Sciweavers

2560 search results - page 15 / 512
» Contributions to zero-sum problems
Sort
View
EVOW
2009
Springer
14 years 2 months ago
Dynamic Time-Linkage Problems Revisited
Dynamic time-linkage problems (DTPs) are common types of dynamic optimization problems where "decisions that are made now ... may in‡uence the maximum score that can be obta...
Trung Thanh Nguyen, Xin Yao
RE
2004
Springer
14 years 1 months ago
Composing Requirements Using Problem Frames
Problem Frames are a systematic approach to the decomposition of problems that allows us to relate requirements, domain properties, and machine specifications. Having decomposed a...
Robin C. Laney, Leonor Barroca, Michael Jackson, B...
SLS
2009
Springer
274views Algorithms» more  SLS 2009»
14 years 14 days ago
A Memetic Algorithm for the Multidimensional Assignment Problem
The Multidimensional Assignment Problem (MAP or s-AP in the case of s dimensions) is an extension of the well-known assignment problem. The most studied case of MAP is 3-AP, though...
Gregory Gutin, Daniel Karapetyan
GRC
2008
IEEE
13 years 9 months ago
Granular Problem Solving and Software Engineering
Granulation is an important component of Granular Computing (GrC) as a problem solving paradigm. Specification and regulation of granulation are necessary in helping researchers a...
Haibin Zhu
FAW
2007
Springer
177views Algorithms» more  FAW 2007»
14 years 2 months ago
The Parameterized Complexity of the Induced Matching Problem in Planar Graphs
Abstract. Given a graph G and a nonnegative integer k, the NP-complete Induced Matching problem asks for an edge subset M such that M is a matching and no two edges of M are joined...
Hannes Moser, Somnath Sikdar