Sciweavers

871 search results - page 137 / 175
» How Realistic is Realism
Sort
View
EOR
2008
52views more  EOR 2008»
13 years 7 months ago
Competitive online scheduling of perfectly malleable jobs with setup times
We study how to efficiently schedule online perfectly malleable parallel jobs with arbitrary arrival times on m 2 processors. We take into account both the linear speedup of such...
Jessen T. Havill, Weizhen Mao
COMPUTER
2006
98views more  COMPUTER 2006»
13 years 7 months ago
Componentization: The Visitor Example
: In software design, laziness is a virtue: it's better to reuse than to redo. Design patterns are a good illustration. Patterns, a major advance in software architecture, pro...
Bertrand Meyer, Karine Arnout
COR
2006
140views more  COR 2006»
13 years 7 months ago
Aggregation for the probabilistic traveling salesman problem
5 In the probabilistic traveling salesman problem (PTSP), customers require a visit with a given probability, and the best solution is the tour through all customers with the lowe...
Ann Melissa Campbell
EOR
2006
40views more  EOR 2006»
13 years 7 months ago
A common notion of clockwise can help in planar rendezvous
Two players are lost in a grid of city streets and wish to meet as soon as possible. Knowing only the distribution of the other's initial location (two nodes away in one of t...
Steve Alpern, Vic Baston
EXPERT
2006
105views more  EXPERT 2006»
13 years 7 months ago
Generating Ambient Behaviors in Computer Role-Playing Games
Many computer games use custom scripts to control the ambient behaviors of non-player characters (NPCs). Therefore, a story writer must write fragments of computer code for the hun...
Maria Cutumisu, Duane Szafron, Jonathan Schaeffer,...