Sciweavers

447 search results - page 35 / 90
» Decision trees with minimal costs
Sort
View
WDAG
2009
Springer
154views Algorithms» more  WDAG 2009»
14 years 3 months ago
Compact Multicast Routing
In a distributed network, a compact multicast scheme is a routing scheme that allows any source to send messages to any set of targets. We study the trade-off between the space us...
Ittai Abraham, Dahlia Malkhi, David Ratajczak
COCOON
2008
Springer
13 years 10 months ago
Approximating the Generalized Capacitated Tree-Routing Problem
In this paper, we introduce the generalized capacitated tree-routing problem (GCTR), which is described as follows. Given a connected graph G = (V, E) with a sink s V and a set M...
Ehab Morsy, Hiroshi Nagamochi
COR
2007
106views more  COR 2007»
13 years 8 months ago
Scheduling parallel CNC machines with time/cost trade-off considerations
When the processing times of jobs are controllable, selected processing times affect both the manufacturing cost and the scheduling performance.A well-known example for such a cas...
Sinan Gurel, M. Selim Akturk
EGPGV
2011
Springer
330views Visualization» more  EGPGV 2011»
13 years 10 days ago
Real-Time Ray Tracer for Visualizing Massive Models on a Cluster
We present a state of the art read-only distributed shared memory (DSM) ray tracer capable of fully utilizing modern cluster hardware to render massive out-of-core polygonal model...
Thiago Ize, Carson Brownlee, Charles D. Hansen
IJCAI
1997
13 years 10 months ago
Minimum Splits Based Discretization for Continuous Features
Discretization refers to splitting the range of continuous values into intervals so as to provide useful information about classes. This is usually done by minimizing a goodness m...
Ke Wang, Han Chong Goh