Sciweavers

355 search results - page 31 / 71
» An Algorithmic Solution of a Birkhoff Type Problem
Sort
View
ICALP
2004
Springer
14 years 1 months ago
A Domain Theoretic Account of Picard's Theorem
We present a domain-theoretic version of Picard’s theorem for solving classical initial value problems in Rn . For the case of vector fields that satisfy a Lipschitz condition, ...
Abbas Edalat, Dirk Pattinson
MFCS
2005
Springer
14 years 2 months ago
Coloring Sparse Random k-Colorable Graphs in Polynomial Expected Time
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
Julia Böttcher
ICPP
2005
IEEE
14 years 2 months ago
Push-Pull: Guided Search DAG Scheduling for Heterogeneous Clusters
Consider a heterogeneous cluster system, consisting of processors with varying processing capabilities and network links with varying bandwidths. Given a DAG application to be sch...
Sang Cheol Kim, Sunggu Lee
IR
2010
13 years 5 months ago
Sentence-level event classification in unstructured texts
The ability to correctly classify sentences that describe events is an important task for many natural language applications such as Question Answering (QA) and Text Summarisation....
Martina Naughton, Nicola Stokes, Joe Carthy
EOR
2006
80views more  EOR 2006»
13 years 8 months ago
Vehicle routing and crew scheduling for metropolitan mail distribution at Australia Post
This paper presents a new multi-depot combined vehicle and crew scheduling algorithm, and uses it, in conjunction with a heuristic vehicle routing algorithm, to solve the intra-ci...
B. L. Hollis, M. A. Forbes, B. E. Douglas