Sciweavers

6142 search results - page 711 / 1229
» The Complexity of Partition Functions
Sort
View
197
Voted
INFOCOM
2000
IEEE
15 years 11 months ago
Networks with Advance Reservations: The Routing Perspective
— This paper provides an initial look at how support for advance reservations affects the complexity of the path selection process in networks. Advance reservations are likely to...
Roch Guérin, Ariel Orda
COLT
2000
Springer
15 years 11 months ago
PAC Analogues of Perceptron and Winnow via Boosting the Margin
We describe a novel family of PAC model algorithms for learning linear threshold functions. The new algorithms work by boosting a simple weak learner and exhibit complexity bounds...
Rocco A. Servedio
ISPD
1999
ACM
128views Hardware» more  ISPD 1999»
15 years 11 months ago
Transistor level micro-placement and routing for two-dimensional digital VLSI cell synthesis
There is an increasing need in modern VLSI designs for circuits implemented in high-performance logic families such as Cascode Voltage Switch Logic, Pass Transistor Logic, and dom...
Michael A. Riepe, Karem A. Sakallah
HICSS
1998
IEEE
89views Biometrics» more  HICSS 1998»
15 years 11 months ago
Managing Cognitive Overload in the Flora of North America Project
The Flora of North America (FNA) is a large-scale collaboration involving over eight hundred scientists working together to create a 30-volume compendium of all naturally occurrin...
J. Alfredo Sánchez, John L. Schnase, Kay L....
ISCA
1998
IEEE
139views Hardware» more  ISCA 1998»
15 years 11 months ago
Simultaneous Multithreading: Maximizing On-Chip Parallelism
This paper examines simultaneous multithreading, a technique permitting several independent threads to issue instructions to a superscalar's multiple functional units in a si...
Dean M. Tullsen, Susan J. Eggers, Henry M. Levy