199 search results - page 28 / 40 » Complexity of two dual criteria scheduling problems |
PKDD
2000
Springer
13 years 11 months ago
2000
Springer
Previous algoritms for the construction of belief networks structures from data are mainly based either on independence criteria or on scoring metrics. The aim of this paper is to ...
SERP
2003
13 years 9 months ago
2003
In recent publications, two prominent approaches can be found which deal with the complexity of large software systems. First, there is the object–oriented approach, where ”ob...
SIGMOD
2010
ACM
14 years 15 days ago
2010
ACM
Modern maps provide a variety of information about roads and their surrounding landscape allowing navigation systems to go beyond simple shortest path computation. In this demo, w...
OOPSLA
2009
Springer
14 years 2 months ago
2009
Springer
Iterations are time-boxed periods with an intended outcome that is often a set of implemented requirements. Iterations are part of most common software development lifecycle model...
CLUSTER
2006
IEEE
13 years 7 months ago
2006
IEEE
Many parallel applications from scientific computing use MPI collective communication operations to collect or distribute data. Since the execution times of these communication op...