Sciweavers

1050 search results - page 196 / 210
» An approach to online optimization of heuristic coordination...
Sort
View
MST
2000
57views more  MST 2000»
13 years 6 months ago
On Scheduling Parallel Tasks at Twilight
We consider the problem of processing a given number of tasks on a given number of processors as quickly as possible when only vague information about the processing time of a task...
Hannah Bast
IPPS
2003
IEEE
14 years 8 hour ago
The Case for Fair Multiprocessor Scheduling
Partitioning and global scheduling are two approaches for scheduling real-time tasks on multiprocessors. Though partitioning is sub-optimal, it has traditionally been preferred; t...
Anand Srinivasan, Philip Holman, James H. Anderson...
EOR
2007
165views more  EOR 2007»
13 years 6 months ago
Adaptive credit scoring with kernel learning methods
Credit scoring is a method of modelling potential risk of credit applications. Traditionally, logistic regression, linear regression and discriminant analysis are the most popular...
Yingxu Yang
IJRR
2010
153views more  IJRR 2010»
13 years 4 months ago
Cooperative AUV Navigation using a Single Maneuvering Surface Craft
This paper describes the experimental implementation of an online algorithm for cooperative localization of submerged autonomous underwater vehicles (AUVs) supported by an autonom...
Maurice F. Fallon, Georgios Papadopoulos, John J. ...
IPPS
2008
IEEE
14 years 1 months ago
SNAP, Small-world Network Analysis and Partitioning: An open-source parallel graph framework for the exploration of large-scale
We present SNAP (Small-world Network Analysis and Partitioning), an open-source graph framework for exploratory study and partitioning of large-scale networks. To illustrate the c...
David A. Bader, Kamesh Madduri