1984 search results - page 18 / 397 » The colourful feasibility problem |
ACSD
2008
IEEE
14 years 4 months ago
2008
IEEE
Asynchronous data communication mechanisms (ACMs) have been extensively studied as data connectors between independently timed concurrent processes. In previous work, two automati...
TACAS
2009
Springer
14 years 4 months ago
2009
Springer
We discuss the problem of path feasibility for programs manipulating strings using a collection of standard string library functions. We prove results on the complexity of this pro...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
We study a novel class of mechanism design problems in which the outcomes are constrained by the payments. This basic class of mechanism design problems captures many common econom...
MICAI
2004
Springer
14 years 3 months ago
2004
Springer
In this paper, we propose a differential evolution algorithm to solve constrained optimization problems. Our approach uses three simple selection criteria based on feasibility to g...
PODS
2003
ACM
14 years 10 months ago
2003
ACM
Computing frequent itemsets and maximally frequent itemsets in a database are classic problems in data mining. The resource requirements of all extant algorithms for both problems...