Sciweavers

7796 search results - page 38 / 1560
» On Generalized Schur Numbers
Sort
View
FOCS
1999
IEEE
14 years 2 months ago
The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals
We consider the DIRECTED STEINER NETWORK problem, also called the POINT-TO-POINT CONNECTION problem, where given a directed graph G and p pairs {(s1,t1),...,(sp,tp)} of nodes in t...
Jon Feldman, Matthias Ruhl
EDBT
2000
ACM
14 years 1 months ago
Mining Classification Rules from Datasets with Large Number of Many-Valued Attributes
Decision tree induction algorithms scale well to large datasets for their univariate and divide-and-conquer approach. However, they may fail in discovering effective knowledge when...
Giovanni Giuffrida, Wesley W. Chu, Dominique M. Ha...
WSC
2007
14 years 6 days ago
Using empirical demand data and common random numbers in an agent-based simulation of a distribution network
Agent-based simulation provides a methodology to investigate complex systems behavior, such as supply chains, while incorporating many empirical elements relative to both systems ...
William J. Sawaya
DAGSTUHL
2008
13 years 11 months ago
Real Algebraic Numbers: Complexity Analysis and Experimentation
Abstract. We present algorithmic, complexity and implementation results concerning real root isolation of a polynomial of degree d, with integer coefficients of bit size , using S...
Ioannis Z. Emiris, Bernard Mourrain, Elias P. Tsig...
CC
2007
Springer
158views System Software» more  CC 2007»
13 years 10 months ago
The Complexity of Membership Problems for Circuits Over Sets of Natural Numbers
Abstract. The problem of testing membership in the subset of the natural numbers produced at the output gate of a {∪, ∩,− , +, ×} combinational circuit is shown to capture a...
Pierre McKenzie, Klaus W. Wagner