Sciweavers

96 search results - page 8 / 20
» Weak Symmetries in Problem Formulations
Sort
View
AIPS
2006
13 years 9 months ago
Optimal Rectangle Packing: A Meta-CSP Approach
We present a new approach to optimal rectangle packing, an NP-complete problem that can be used to model many simple scheduling tasks. Recent attempts at incorporating artificial ...
Michael D. Moffitt, Martha E. Pollack
HEURISTICS
2008
136views more  HEURISTICS 2008»
13 years 6 months ago
Enhancing set constraint solvers with lexicographic bounds
Since their beginning in constraint programming, set solvers have been applied to a wide range of combinatorial search problems, such as bin-packing, set partitioning, circuit desi...
Andrew Sadler, Carmen Gervet
EJC
2000
13 years 9 months ago
User Interface Modelling with UML
Abstract. The Unified Modeling Language (UML) is a natural candidate for user interface (UI) modelling since it is the standard notation for object oriented modelling of applicatio...
Paulo Pinheiro da Silva, Norman W. Paton
ACS
2011
13 years 2 months ago
Algebras of Higher Operads as Enriched Categories
Abstract. One of the open problems in higher category theory is the systematic construction of the higher dimensional analogues of the Gray tensor product. In this paper we begin t...
Michael Batanin, Mark Weber
CP
2006
Springer
13 years 9 months ago
Distributed Stable Matching Problems with Ties and Incomplete Lists
We consider the Stable Marriage Problem and the Stable Roommates Problem in presence of ties and incomplete preference lists. They can be solved by centralized algorithms, but this...
Ismel Brito, Pedro Meseguer