Sciweavers

285 search results - page 48 / 57
» A fuzzy random forest
Sort
View
FLAIRS
2003
15 years 5 months ago
On the Computation of Local Interchangeability in Soft Constraint Satisfaction Problems
Freuder in (1991) defined interchangeability for classical Constraint Satisfaction Problems (CSPs). Recently (2002), we extended the definition of interchangeability to Soft CSP...
Nicoleta Neagu, Stefano Bistarelli, Boi Faltings
COMPUTER
1999
82views more  COMPUTER 1999»
15 years 3 months ago
Mapping the Internet
Discovery of a network topology is a challenging task. Available algorithms that rely on simple hop-limited, traceroute-style probes give different performance in terms of the com...
Hal Burch, Bill Cheswick
TSMC
2002
119views more  TSMC 2002»
15 years 3 months ago
Nonlinear adaptive control using the Fourier integral and its application to CSTR systems
Abstract--This paper presents a new nonlinear adaptive tracking controller for a class of general time-variant nonlinear systems. The control system consists of an inner loop and a...
Huaguang Zhang, Lilong Cai
CSDA
2008
128views more  CSDA 2008»
15 years 4 months ago
Classification tree analysis using TARGET
Tree models are valuable tools for predictive modeling and data mining. Traditional tree-growing methodologies such as CART are known to suffer from problems including greediness,...
J. Brian Gray, Guangzhe Fan
CORR
2011
Springer
188views Education» more  CORR 2011»
14 years 11 months ago
Towards Unbiased BFS Sampling
Abstract—Breadth First Search (BFS) is a widely used approach for sampling large unknown Internet topologies. Its main advantage over random walks and other exploration technique...
Maciej Kurant, Athina Markopoulou, Patrick Thiran