Sciweavers

2899 search results - page 506 / 580
» Dynamic Trees in Practice
Sort
View
SOPR
2002
106views more  SOPR 2002»
13 years 9 months ago
A discrete simulation model for assessing software project scheduling policies
Good project scheduling is an essential, but extremely hard task in software management practice. In a software project, the time needed to complete some development activity is d...
Frank Padberg
CORR
2008
Springer
118views Education» more  CORR 2008»
13 years 9 months ago
Decentralized Search with Random Costs
A decentralized search algorithm is a method of routing on a random graph that uses only limited, local, information about the realization of the graph. In some random graph model...
Oskar Sandberg
NLE
2007
180views more  NLE 2007»
13 years 9 months ago
Segmentation and alignment of parallel text for statistical machine translation
We address the problem of extracting bilingual chunk pairs from parallel text to create training sets for statistical machine translation. We formulate the problem in terms of a s...
Yonggang Deng, Shankar Kumar, William Byrne
ICRA
2010
IEEE
146views Robotics» more  ICRA 2010»
13 years 8 months ago
Statistical mobility prediction for planetary surface exploration rovers in uncertain terrain
— Planetary surface exploration rovers must accurately and efficiently predict their mobility on natural, rough terrain. Most approaches to mobility prediction assume precise a p...
Genya Ishigami, Gaurav Kewlani, Karl Iagnemma
INFOCOM
2010
IEEE
13 years 8 months ago
Distributed Resource Allocation for Synchronous Fork and Join Processing Networks
—Many emerging information processing applications require applying various fork and join type operations such as correlation, aggregation, and encoding/decoding to data streams ...
Haiquan (Chuck) Zhao, Cathy H. Xia, Zhen Liu, Dona...