Sciweavers

1312 search results - page 112 / 263
» Formally Optimal Boxing
Sort
View
NETWORK
2011
13 years 3 days ago
Dynamic measurement-aware routing in practice
Traffic monitoring is a critical network operation for the purpose of traffic accounting, debugging or troubleshooting, forensics, and traffic engineering. Existing techniques for...
Guanyao Huang, Chen-Nee Chuah, Saqib Raza, Srini S...
CANDC
2011
ACM
12 years 9 months ago
Understanding exploratory creativity in a visual domain
This paper describes a computerized aesthetic composition task that is based on a “creativity as search” metaphor. The technique collects detailed, moment-to-moment data about...
Kyle E. Jennings, Dean Keith Simonton, Stephen E. ...
ICCAD
2003
IEEE
99views Hardware» more  ICCAD 2003»
14 years 2 months ago
A Probabilistic Approach to Buffer Insertion
This work presents a formal probabilistic approach for solving optimization problems in design automation. Prediction accuracy is very low especially at high levels of design flo...
Vishal Khandelwal, Azadeh Davoodi, Akash Nanavati,...
ATAL
2007
Springer
14 years 3 months ago
Convergence and rate of convergence of a simple ant model
We present a simple ant model that solves a discrete foraging problem. We describe simulations and provide a complete convergence analysis: we show that the ant population compute...
Amine M. Boumaza, Bruno Scherrer
COLT
2000
Springer
14 years 1 months ago
The Computational Complexity of Densest Region Detection
We investigate the computational complexity of the task of detecting dense regions of an unknown distribution from un-labeled samples of this distribution. We introduce a formal l...
Shai Ben-David, Nadav Eiron, Hans-Ulrich Simon