Sciweavers

920 search results - page 67 / 184
» Generating Satisfiable Problem Instances
Sort
View
GECCO
2008
Springer
238views Optimization» more  GECCO 2008»
13 years 12 months ago
Using multiple offspring sampling to guide genetic algorithms to solve permutation problems
The correct choice of an evolutionary algorithm, a genetic representation for the problem being solved (as well as their associated variation operators) and the appropriate values...
Antonio LaTorre, José Manuel Peña, V...
CDC
2008
IEEE
145views Control Systems» more  CDC 2008»
13 years 11 months ago
Necessary and sufficient conditions for success of the nuclear norm heuristic for rank minimization
Minimizing the rank of a matrix subject to constraints is a challenging problem that arises in many applications in control theory, machine learning, and discrete geometry. This c...
Benjamin Recht, Weiyu Xu, Babak Hassibi
KDID
2004
149views Database» more  KDID 2004»
14 years 4 days ago
Database Transposition for Constrained (Closed) Pattern Mining
Abstract. Recently, different works proposed a new way to mine patterns in databases with pathological size. For example, experiments in genome biology usually provide databases wi...
Baptiste Jeudy, François Rioult
ICCAD
2010
IEEE
140views Hardware» more  ICCAD 2010»
13 years 8 months ago
Reduction of interpolants for logic synthesis
Craig Interpolation is a state-of-the-art technique for logic synthesis and verification, based on Boolean Satisfiability (SAT). Leveraging the efficacy of SAT algorithms, Craig In...
John D. Backes, Marc D. Riedel
ATAL
2006
Springer
14 years 2 months ago
Agent interaction in distributed POMDPs and its implications on complexity
The ability to coordinate effectively is critical for agents to accomplish their goals in a multi-agent system. A number of researchers have modeled the coordination problem for m...
Jiaying Shen, Raphen Becker, Victor R. Lesser