Sciweavers

2693 search results - page 13 / 539
» French Order Without Order
Sort
View
ILP
2004
Springer
14 years 26 days ago
First Order Random Forests with Complex Aggregates
Random forest induction is a bagging method that randomly samples the feature set at each node in a decision tree. In propositional learning, the method has been shown to work well...
Celine Vens, Anneleen Van Assche, Hendrik Blockeel...
FLAIRS
2007
13 years 9 months ago
Search Ordering Heuristics for Restarts-Based Constraint Solving
Constraint Satisfaction Problems are ubiquitous in Artificial Intelligence. Over the past decade significant advances have been made in terms of the size of problem instance tha...
Margarita Razgon, Barry O'Sullivan, Gregory M. Pro...
AI
2006
Springer
13 years 7 months ago
Discovering the linear writing order of a two-dimensional ancient hieroglyphic script
This paper demonstrates how machine learning methods can be applied to deal with a realworld decipherment problem where very little background knowledge is available. The goal is ...
Shou de Lin, Kevin Knight
JCO
2006
83views more  JCO 2006»
13 years 7 months ago
Separating online scheduling algorithms with the relative worst order ratio
The relative worst order ratio is a measure for the quality of online algorithms. Unlike the competitive ratio, it compares algorithms directly without involving an optimal offline...
Leah Epstein, Lene M. Favrholdt, Jens S. Kohrt
DAC
1998
ACM
14 years 8 months ago
A Mixed Nodal-Mesh Formulation for Efficient Extraction and Passive Reduced-Order Modeling of 3D Interconnects
As VLSI circuit speeds have increased, reliable chip and system design can no longer be performed without accurate threedimensional interconnect models. In this paper, we describe...
Nuno Alexandre Marques, Mattan Kamon, Jacob White,...