Sciweavers

936 search results - page 57 / 188
» The Synthesis Problem of Netcharts
Sort
View
121
Voted
GECCO
2006
Springer
139views Optimization» more  GECCO 2006»
15 years 7 months ago
Genetic programming: optimal population sizes for varying complexity problems
The population size in evolutionary computation is a significant parameter affecting computational effort and the ability to successfully evolve solutions. We find that population...
Alan Piszcz, Terence Soule
140
Voted
SAT
2007
Springer
95views Hardware» more  SAT 2007»
15 years 10 months ago
Solving Multi-objective Pseudo-Boolean Problems
Integer Linear Programs are widely used in areas such as routing problems, scheduling analysis and optimization, logic synthesis, and partitioning problems. As many of these proble...
Martin Lukasiewycz, Michael Glaß, Christian ...
CODES
2005
IEEE
15 years 9 months ago
Key research problems in NoC design: a holistic perspective
Networks-on-Chip (NoCs) have been recently proposed as a promising solution to complex on-chip communication problems. The lack of an unified representation of applications and ar...
Ümit Y. Ogras, Jingcao Hu, Radu Marculescu
129
Voted
ICMAS
2000
15 years 5 months ago
The Computational Complexity of Agent Design Problems
This paper investigates the computational complexity of a fundamental problem in multi-agent systems: given an environment together with a specification of some task, can we const...
Michael Wooldridge
129
Voted
IFM
1999
Springer
15 years 8 months ago
Integration Problems in Telephone Feature Requirements
The feature interaction problem is prominent in telephone service development. Through a number of case studies, we have discovered that no single semantic framework is suitable f...
J. Paul Gibson, Geoff Hamilton, Dominique Mé...