Sciweavers

85 search results - page 3 / 17
» New Developments in Symmetry Breaking in Search Using Comput...
Sort
View
DAC
1994
ACM
13 years 9 months ago
Boolean Matching Using Generalized Reed-Muller Forms
-- In this paper we present a new method for Boolean matching of completely specified Boolean functions. The canonical Generalized Reed-Muller forms are used as a powerful analysis...
Chien-Chung Tsai, Malgorzata Marek-Sadowska
CONSTRAINTS
2011
13 years 23 days ago
Solving Steel Mill Slab Problems with constraint-based techniques: CP, LNS, and CBLS
The Steel Mill Slab Problem is an optimization benchmark that has been studied for a long time in the constraint-programming community but was only solved efficiently in the two l...
Pierre Schaus, Pascal Van Hentenryck, Jean-Noë...
JCB
1998
129views more  JCB 1998»
13 years 5 months ago
A Sticker-Based Model for DNA Computation
We introduce a new model of molecular computation that we call the sticker model. Like many previous proposals it makes use of DNA strands as the physical substrate in which infor...
Sam T. Roweis, Erik Winfree, Richard Burgoyne, Nic...
DCC
2006
IEEE
14 years 5 months ago
Applications of representation theory to wireless communications
In this paper we demonstrate a new and original way to apply the representation theory of finite groups to the development of space-time codes for use in multiple antenna wireless ...
Ali Miri, Monica Nevins, Terasan Niyomsataya
GECCO
2005
Springer
109views Optimization» more  GECCO 2005»
13 years 11 months ago
Information landscapes and the analysis of search algorithms
In [15] we introduced the information landscape as a new concept of a landscape. We showed that for a landscape of a small size, information landscape theory can be used to predic...
Yossi Borenstein, Riccardo Poli