Sciweavers

507 search results - page 39 / 102
» Sizes of Ordered Decision Trees
Sort
View
SCHEDULING
2008
89views more  SCHEDULING 2008»
13 years 7 months ago
On-line decision support for take-off runway scheduling with uncertain taxi times at London Heathrow airport
: This paper addresses the challenge of building an automated decision support methodology to tackle the complex problem faced every day by runway controllers at London Heathrow Ai...
Jason A. D. Atkin, Edmund K. Burke, John S. Greenw...
ALGORITHMICA
2010
112views more  ALGORITHMICA 2010»
13 years 8 months ago
On Sorting, Heaps, and Minimum Spanning Trees
Let A be a set of size m. Obtaining the first k m elements of A in ascending order can be done in optimal O(m + k log k) time. We present Incremental Quicksort (IQS), an algorith...
Gonzalo Navarro, Rodrigo Paredes
AIPS
2004
13 years 9 months ago
Optimal Resource Allocation and Policy Formulation in Loosely-Coupled Markov Decision Processes
The problem of optimal policy formulation for teams of resource-limited agents in stochastic environments is composed of two strongly-coupled subproblems: a resource allocation pr...
Dmitri A. Dolgov, Edmund H. Durfee
BMCBI
2005
100views more  BMCBI 2005»
13 years 7 months ago
Speeding disease gene discovery by sequence based candidate prioritization
Background: Regions of interest identified through genetic linkage studies regularly exceed 30 centimorgans in size and can contain hundreds of genes. Traditionally this number is...
Euan A. Adie, Richard R. Adams, Kathryn L. Evans, ...
ICDE
1999
IEEE
114views Database» more  ICDE 1999»
14 years 9 months ago
Scalable Classification over SQL Databases
We identify data-intensive operations that are common to classifiers and develop a middleware that decomposes and schedules these operations efficiently using a backend SQL databa...
Surajit Chaudhuri, Usama M. Fayyad, Jeff Bernhardt