Sciweavers

1026 search results - page 114 / 206
» On Finding Minimal w-cutset
Sort
View
CSCW
1998
ACM
15 years 10 months ago
Just Talk to Me: A Field Study of Expertise Location
Everyday, people in organizations must solve their problems to get their work accomplished. To do so, they often must find others with knowledge and information. Systems that assi...
David W. McDonald, Mark S. Ackerman
SODA
2008
ACM
127views Algorithms» more  SODA 2008»
15 years 7 months ago
Nondecreasing paths in a weighted graph or: how to optimally read a train schedule
A travel booking office has timetables giving arrival and departure times for all scheduled trains, including their origins and destinations. A customer presents a starting city a...
Virginia Vassilevska
AAAI
2006
15 years 7 months ago
Properties of Forward Pruning in Game-Tree Search
Forward pruning, or selectively searching a subset of moves, is now commonly used in game-playing programs to reduce the number of nodes searched with manageable risk. Forward pru...
Yew Jin Lim, Wee Sun Lee
ISLPED
2010
ACM
169views Hardware» more  ISLPED 2010»
15 years 6 months ago
TurboTag: lookup filtering to reduce coherence directory power
On-chip coherence directories of today's multi-core systems are not energy efficient. Coherence directories dissipate a significant fraction of their power on unnecessary loo...
Pejman Lotfi-Kamran, Michael Ferdman, Daniel Crisa...
FUIN
2008
80views more  FUIN 2008»
15 years 6 months ago
External Memory Algorithms for String Problems
In this paper we present external memory algorithms for some string problems. External memory algorithms have been developed in many research areas, as the speed gap between fast ...
Kangho Roh, Maxime Crochemore, Costas S. Iliopoulo...