Sciweavers

17967 search results - page 381 / 3594
» Functional timing optimization
Sort
View
CORR
2002
Springer
111views Education» more  CORR 2002»
15 years 6 months ago
The Fastest and Shortest Algorithm for All Well-Defined Problems
An algorithm M is described that solves any well-defined problem p as quickly as the fastest algorithm computing a solution to p, save for a factor of 5 and loworder additive term...
Marcus Hutter
AI
1999
Springer
15 years 6 months ago
Learning by Discovering Concept Hierarchies
We present a new machine learning method that, given a set of training examples, induces a definition of the target concept in terms of a hierarchy of intermediate concepts and th...
Blaz Zupan, Marko Bohanec, Janez Demsar, Ivan Brat...
CORR
2010
Springer
130views Education» more  CORR 2010»
15 years 3 months ago
Oblivious Buy-at-Bulk in Planar Graphs
In the oblivious buy-at-bulk network design problem in a graph, the task is to compute a fixed set of paths for every pair of source-destination in the graph, such that any set of ...
Srinivasagopalan Srivathsan, Costas Busch, S. Sith...
HIS
2009
15 years 4 months ago
A Particle Swarm Optimization with Feasibility-Based Rules for Mixed-Variable Optimization Problems
A Particle Swarm Optimization algorithm with feasibility-based rules (FRPSO) is proposed in this paper to solve mixed-variable optimization problems. An approach to handle various ...
Chao-Li Sun, Jian-Chao Zeng, Jeng-Shyang Pan
ICML
2006
IEEE
16 years 7 months ago
Probabilistic inference for solving discrete and continuous state Markov Decision Processes
Inference in Markov Decision Processes has recently received interest as a means to infer goals of an observed action, policy recognition, and also as a tool to compute policies. ...
Marc Toussaint, Amos J. Storkey