Sciweavers

2150 search results - page 31 / 430
» On a restricted cross-intersection problem
Sort
View
CP
2005
Springer
15 years 3 months ago
Solution Equivalent Subquadrangle Reformulations of Constraint Satisfaction Problems
Abstract. Subquadrangles are a natural way in which to represent constraints as they do not restrict any subset of their scope. There are already known methods for converting any g...
Chris Houghton, David A. Cohen
IMECS
2007
14 years 11 months ago
Genetic Algorithms for the Nesting Problem in the Packing Industry
— The problem of parts nesting in plane areas is found in several industries, with restrictions and different objectives. Among these industries having this process they are pack...
Roberto Selow, Flavio Neves Junior, Heitor S. Lope...
TCS
2008
14 years 9 months ago
The complexity of uniform Nash equilibria and related regular subgraph problems
We investigate the complexity of finding Nash equilibria in which the strategy of each player is uniform on its support set. We show that, even for a restricted class of win-lose ...
Vincenzo Bonifaci, Ugo Di Iorio, Luigi Laura
164
Voted
CONCUR
2012
Springer
13 years 2 days ago
Decidability Problems for Actor Systems
We introduce a nominal actor-based language and study its expressive power. We have identified the presence/absence of fields as a relevant feature: the dynamic creation of names...
Frank S. de Boer, Mahdi Mahdi Jaghoori, Cosimo Lan...
JCO
2011
115views more  JCO 2011»
14 years 4 months ago
Approximation scheme for restricted discrete gate sizing targeting delay minimization
Discrete gate sizing is a critical optimization in VLSI circuit design. Given a set of available gate sizes, discrete gate sizing problem asks to assign a size to each gate such th...
Chen Liao, Shiyan Hu