Sciweavers

2542 search results - page 251 / 509
» Computing Cartograms with Optimal Complexity
Sort
View
98
Voted
ASAP
2004
IEEE
171views Hardware» more  ASAP 2004»
15 years 4 months ago
CHARMED: A Multi-Objective Co-Synthesis Framework for Multi-Mode Embedded Systems
In this paper, we present a modular co-synthesis framework called CHARMED that solves the problem of hardware-software co-synthesis of periodic, multi-mode, distributed, embedded ...
Vida Kianzad, Shuvra S. Bhattacharyya
103
Voted
GECCO
2006
Springer
178views Optimization» more  GECCO 2006»
15 years 4 months ago
Adaptively choosing niching parameters in a PSO
Niching techniques play an important role in evolutionary algorithms. Existing niching methods often require userspecified parameters, limiting their usefulness. This paper propos...
Stefan Bird, Xiaodong Li
GECCO
2006
Springer
135views Optimization» more  GECCO 2006»
15 years 4 months ago
The no free lunch and realistic search algorithms
The No-Free-Lunch theorems (NFLTs) are criticized for being too general to be of any relevance to the real world scenario. This paper investigates, both formally and empirically, ...
Yossi Borenstein, Riccardo Poli
88
Voted
NIPS
2007
15 years 2 months ago
A Risk Minimization Principle for a Class of Parzen Estimators
This paper1 explores the use of a Maximal Average Margin (MAM) optimality principle for the design of learning algorithms. It is shown that the application of this risk minimizati...
Kristiaan Pelckmans, Johan A. K. Suykens, Bart De ...
ICMAS
2000
15 years 1 months ago
Integer Programming for Combinatorial Auction Winner Determination
Combinatorial auctions are important as they enable bidders to place bids on combinations of items; compared to other auction mechanisms, they often increase the efficiency of the...
Arne Andersson, Mattias Tenhunen, Fredrik Ygge