Sciweavers

11160 search results - page 278 / 2232
» Incompleteness in a General Setting
Sort
View
GECCO
2005
Springer
104views Optimization» more  GECCO 2005»
15 years 11 months ago
MOEA design of robust digital symbol sets
Optimal constellation design is important in military digital communications for Quadrature Amplitude Modulation (QAM). Optimization realizes a reduced probability of bit error (P...
Richard O. Day, Abel S. Nunez, Gary B. Lamont
GECCO
2005
Springer
158views Optimization» more  GECCO 2005»
15 years 11 months ago
A genetic algorithm approach to the selection of near-optimal subsets from large sets
The problem attempted in this paper is to select a sample from a large set where the sample is required to have a particular average property. The problem can be expressed as an o...
P. Whiting, P. W. Poon, J. N. Carter
LPNMR
2004
Springer
15 years 11 months ago
Towards Automated Integration of Guess and Check Programs in Answer Set Programming
Abstract. Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and check...
Thomas Eiter, Axel Polleres
AGP
2003
IEEE
15 years 11 months ago
Transforming co-NP Checks to Answer Set Computation by Meta-Interpretation
Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and check” nature ...
Thomas Eiter, Axel Polleres
MICRO
2003
IEEE
95views Hardware» more  MICRO 2003»
15 years 11 months ago
Processor Acceleration Through Automated Instruction Set Customization
Application-specific extensions to the computational capabilities of a processor provide an efficient mechanism to meet the growing performance and power demands of embedded appl...
Nathan Clark, Hongtao Zhong, Scott A. Mahlke