Sciweavers

2634 search results - page 166 / 527
» Faster Than Uppaal
Sort
View
ECML
2006
Springer
15 years 9 months ago
An Efficient Approximation to Lookahead in Relational Learners
Abstract. Greedy machine learning algorithms suffer from shortsightedness, potentially returning suboptimal models due to limited exploration of the search space. Greedy search mis...
Jan Struyf, Jesse Davis, C. David Page Jr.
ECOOP
2006
Springer
15 years 9 months ago
Efficient Object Querying for Java
Modern programming languages have little or no support for querying objects and collections. Programmers are forced to hand code such queries using nested loops, which is both cumb...
Darren Willis, David J. Pearce, James Noble
EVOW
2006
Springer
15 years 9 months ago
Supervised Genetic Search for Parameter Selection in Painterly Rendering
This paper investigates the feasibility of evolutionary search techniques as a mechanism for interactively exploring the design space of 2D painterly renderings. Although a growing...
John P. Collomosse
FPL
2006
Springer
91views Hardware» more  FPL 2006»
15 years 9 months ago
Multi-Bit Carry Chains for High-Performance Reconfigurable Fabrics
Ripple-carry architectures are the norm in today's reconfigurable fabrics. They are simple, require minimal routing, and are easily formed across arbitrary cells in a fabric....
Michael T. Frederick, Arun K. Somani
GECCO
2006
Springer
157views Optimization» more  GECCO 2006»
15 years 9 months ago
gLINC: identifying composability using group perturbation
We present two novel perturbation-based linkage learning algorithms that extend LINC [5]; a version of LINC optimised for decomposition tasks (oLINC) and a hierarchical version of...
David Jonathan Coffin, Christopher D. Clack