Sciweavers

1449 search results - page 250 / 290
» Self-Randomized Exponentiation Algorithms
Sort
View
146
Voted
ICTAI
2002
IEEE
15 years 7 months ago
Calculus of Variations in Discrete Space for Constrained Nonlinear Dynamic Optimization
In this paper, we propose new dominance relations that can speed up significantly the solution process of nonlinear constrained dynamic optimization problems in discrete time and...
Yixin Chen, Benjamin W. Wah
COCO
2001
Springer
149views Algorithms» more  COCO 2001»
15 years 7 months ago
Quantum versus Classical Learnability
Motivated by recent work on quantum black-box query complexity, we consider quantum versions of two wellstudied models of learning Boolean functions: Angluin’s model of exact le...
Rocco A. Servedio, Steven J. Gortler
132
Voted
PODC
2006
ACM
15 years 8 months ago
Computing separable functions via gossip
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...
Damon Mosk-Aoyama, Devavrat Shah
159
Voted
CN
2011
176views more  CN 2011»
14 years 6 months ago
Taming the elephants: New TCP slow start
Standard slow start does not work well under large bandwidthdelay product (BDP) networks. We find two causes of this problem in existing three popular operating systems, Linux, F...
Sangtae Ha, Injong Rhee
WADS
2001
Springer
182views Algorithms» more  WADS 2001»
15 years 7 months ago
On the Complexity of Scheduling Conditional Real-Time Code
Abstract. Many real-time embedded systems involve a collection of independently executing event-driven code blocks, having hard real-time constraints. Portions of such codes when t...
Samarjit Chakraborty, Thomas Erlebach, Lothar Thie...