Sciweavers

Share
EVOW
2011
Springer
8 years 1 months ago
When Novelty Is Not Enough
Abstract. The idea of evolving novel rather than fit solutions has recently been offered as a way to automatically discover the kind of complex solutions that exhibit truly intel...
Giuseppe Cuccu, Faustino J. Gomez
EOR
2006
148views more  EOR 2006»
8 years 10 months ago
Pareto ant colony optimization with ILP preprocessing in multiobjective project portfolio selection
One of the most important, common and critical management issues lies in determining the "best" project portfolio out of a given set of investment proposals. As this dec...
Karl F. Doerner, Walter J. Gutjahr, Richard F. Har...
CORR
2006
Springer
132views Education» more  CORR 2006»
8 years 10 months ago
The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies
Boolean satisfiability problems are an important benchmark for questions about complexity, algorithms, heuristics and threshold phenomena. Recent work on heuristics, and the satis...
Parikshit Gopalan, Phokion G. Kolaitis, Elitza N. ...
IJCAI
2007
8 years 11 months ago
From Sampling to Model Counting
We introduce a new technique for counting models of Boolean satisfiability problems. Our approach incorporates information obtained from sampling the solution space. Unlike previ...
Carla P. Gomes, Jörg Hoffmann, Ashish Sabharw...
GECCO
2006
Springer
164views Optimization» more  GECCO 2006»
9 years 1 months ago
Biobjective evolutionary and heuristic algorithms for intersection of geometric graphs
Wire routing in a VLSI chip often requires minimization of wire-length as well as the number of intersections among multiple nets. Such an optimization problem is computationally ...
Rajeev Kumar, Pramod Kumar Singh, Bhargab B. Bhatt...
CONPAR
1994
9 years 2 months ago
A Framework for Resource-Constrained Rate-Optimal Software Pipelining
The rapid advances in high-performancecomputer architectureand compilationtechniques provide both challenges and opportunitiesto exploitthe rich solution space of software pipeline...
Ramaswamy Govindarajan, Erik R. Altman, Guang R. G...
RTA
1997
Springer
9 years 2 months ago
Solving Linear Diophantine Equations Using the Geometric Structure of the Solution Space
In the development of algorithms for finding the minimal solutions of systems of linear Diophantine equations, little use has been made (to our knowledge) of the results by Stanle...
Ana Paula Tomás, Miguel Filgueiras
ECBS
2010
IEEE
146views Hardware» more  ECBS 2010»
9 years 3 months ago
Design-Space Exploration through Constraint-Based Model-Transformation
Abstract—Many design steps during system development like functional partitioning, refactoring of the architecture, or the mapping to the platform - can be understood as an explo...
Bernhard Schätz, Florian Hölzl, Torbj&ou...
ICCBR
2007
Springer
9 years 4 months ago
Case-Based Reasoning Adaptation for High Dimensional Solution Space
Case-Based Reasoning (CBR) is a methodology that reuses the solutions of previous similar problems to solve new problems. Adaptation is the most difficult stage in the CBR cycle, e...
Ying Zhang, Panos Louvieris, Maria Petrou
AGTIVE
2007
Springer
9 years 4 months ago
Ludo: A Case Study for Graph Transformation Tools
In this paper we describe the Ludo case, one of the case studies of the AGTIVE 2007 Tool Contest (see [22]). After summarising the case description, we give an overview of the subm...
Arend Rensink, Alexander Dotor, Claudia Ermel, Ste...
books