Sciweavers

1477 search results - page 275 / 296
» Random Convex Programs
Sort
View
ICALP
2001
Springer
14 years 13 hour ago
Approximating the Minimum Spanning Tree Weight in Sublinear Time
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
Bernard Chazelle, Ronitt Rubinfeld, Luca Trevisan
ASPLOS
2000
ACM
13 years 12 months ago
Symbiotic Jobscheduling for a Simultaneous Multithreading Processor
Simultaneous Multithreading machines fetch and execute instructions from multiple instruction streams to increase system utilization and speedup the execution of jobs. When there ...
Allan Snavely, Dean M. Tullsen
ICCAD
1999
IEEE
181views Hardware» more  ICCAD 1999»
13 years 12 months ago
A new heuristic for rectilinear Steiner trees
The minimum rectilinear Steiner tree (RST) problem is one of the fundamental problems in the field of electronic design automation. The problem is NP-hard, and much work has been ...
Ion I. Mandoiu, Vijay V. Vazirani, Joseph L. Ganle...
AAAI
2006
13 years 9 months ago
ScriptEase - Motivational Behaviors for Interactive Characters in Computer Role-Playing Games
ScriptEase is a tool that allows authors with no programming experience to create interactive stories for computer role-playing games. Instead of writing scripting code manually, ...
Maria Cutumisu, Duane Szafron, Jonathan Schaeffer,...
SODA
2000
ACM
122views Algorithms» more  SODA 2000»
13 years 8 months ago
Cooperative facility location games
The location of facilities in order to provide service for customers is a well-studied problem in the operations research literature. In the basic model, there is a predefined cos...
Michel X. Goemans, Martin Skutella