Sciweavers

2208 search results - page 15 / 442
» On Issues of Instance Selection
Sort
View
AAAI
1998
13 years 10 months ago
Branch and Bound Algorithm Selection by Performance Prediction
Wepropose a method called Selection by Performance Prediction (SPP) which allows one, when faced with a particular problem instance, to select a Branch and Boundalgorithm from amo...
Lionel Lobjois, Michel Lemaître
WINE
2005
Springer
122views Economy» more  WINE 2005»
14 years 2 months ago
Walrasian Equilibrium: Hardness, Approximations and Tractable Instances
We study the complexity issues for Walrasian equilibrium in a special case of combinatorial auction, called single-minded auction, in which every participant is interested in only ...
Ning Chen, Atri Rudra
CONEXT
2008
ACM
13 years 10 months ago
Instability free routing: beyond one protocol instance
Today, a large body of research exists regarding the correctness of routing protocols. However, many reported global disruptions of Internet connectivity, e.g., inter-AS persisten...
Franck Le, Geoffrey G. Xie, Hui Zhang
ICDM
2009
IEEE
137views Data Mining» more  ICDM 2009»
14 years 3 months ago
Set-Based Boosting for Instance-Level Transfer
—The success of transfer to improve learning on a target task is highly dependent on the selected source data. Instance-based transfer methods reuse data from the source tasks to...
Eric Eaton, Marie desJardins
SOFSEM
2004
Springer
14 years 1 months ago
Measures of Intrinsic Hardness for Constraint Satisfaction Problem Instances
Our aim is to investigate the factors which determine the intrinsic hardness of constructing a solution to any particular constraint satisfaction problem instance, regardless of th...
George Boukeas, Constantinos Halatsis, Vassilis Zi...