Sciweavers

1972 search results - page 366 / 395
» Evolutionary algorithms and dynamic programming
Sort
View
123
Voted
DAC
1997
ACM
15 years 6 months ago
Wire Segmenting for Improved Buffer Insertion
Buffer insertion seeks to place buffers on the wires of a signal net to minimize delay. Van Ginneken [14] proposed an optimal dynamic programming solution (with extensions propose...
Charles J. Alpert, Anirudh Devgan
121
Voted
ICDM
2007
IEEE
136views Data Mining» more  ICDM 2007»
15 years 6 months ago
Data Discretization Unification
Data discretization is defined as a process of converting continuous data attribute values into a finite set of intervals with minimal loss of information. In this paper, we prove...
Ruoming Jin, Yuri Breitbart, Chibuike Muoh
98
Voted
IJCAI
2007
15 years 4 months ago
Automated Design of Multistage Mechanisms
Mechanism design is the study of preference aggregation protocols that work well in the face of self-interested agents. We present the first general-purpose techniques for automa...
Tuomas Sandholm, Vincent Conitzer, Craig Boutilier
109
Voted
ICPR
2010
IEEE
15 years 2 months ago
A Probabilistic Language Model for Hand Drawings
Probabilistic language models are critical to applications in natural language processing that include speech recognition, optical character recognition, and interfaces for text e...
Abdullah Akce, Timothy Bretl
142
Voted
CN
2006
145views more  CN 2006»
15 years 2 months ago
Understanding optimal data gathering in the energy and latency domains of a wireless sensor network
The problem of optimal data gathering in wireless sensor networks (WSNs) is addressed by means of optimization techniques. The goal of this work is to lay the foundations to devel...
Ugo Monaco, Francesca Cuomo, Tommaso Melodia, Fabi...