Sciweavers

2543 search results - page 75 / 509
» Optimal Ordered Problem Solver
Sort
View
AI
2006
Springer
14 years 10 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
ICTAI
2005
IEEE
15 years 3 months ago
Subgoal Ordering and Granularity Control for Incremental Planning
In this paper, we study strategies in incremental planning for ordering and grouping subproblems partitioned by the subgoals of a planning problem when each subproblem is solved b...
Chih-Wei Hsu, Yixin Chen
CVPR
2007
IEEE
15 years 12 months ago
P3 & Beyond: Solving Energies with Higher Order Cliques
In this paper we extend the class of energy functions for which the optimal -expansion and -swap moves can be computed in polynomial time. Specifically, we introduce a class of hi...
Pushmeet Kohli, M. Pawan Kumar, Philip H. S. Torr
SAT
2010
Springer
172views Hardware» more  SAT 2010»
14 years 8 months ago
On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem
Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the ...
Denis Pankratov, Allan Borodin
PARA
2004
Springer
15 years 3 months ago
Cache Optimizations for Iterative Numerical Codes Aware of Hardware Prefetching
Cache optimizations typically include code transformations to increase the locality of memory accesses. An orthogonal approach is to enable for latency hiding by introducing prefet...
Josef Weidendorfer, Carsten Trinitis