Sciweavers

2150 search results - page 134 / 430
» On a restricted cross-intersection problem
Sort
View
169
Voted
AAAI
2004
15 years 6 months ago
Space-Efficient Memory-Based Heuristics
A memory-based heuristic is a heuristic function that is stored in a lookup table. Very accurate heuristics have been created by building very large lookup tables, sometimes calle...
Rong Zhou, Eric A. Hansen
AAAI
1998
15 years 6 months ago
Solving Very Large Weakly Coupled Markov Decision Processes
We present a technique for computing approximately optimal solutions to stochastic resource allocation problems modeled as Markov decision processes (MDPs). We exploit two key pro...
Nicolas Meuleau, Milos Hauskrecht, Kee-Eung Kim, L...
USITS
2003
15 years 6 months ago
Network-Sensitive Service Discovery
We consider the problem of network-sensitive service selection (NSSS): finding services that match a particular set of functional and network properties. Current solutions handle...
An-Cheng Huang, Peter Steenkiste
BIRTHDAY
2010
Springer
15 years 5 months ago
Halting and Equivalence of Program Schemes in Models of Arbitrary Theories
In this note we consider the following decision problems. Let be a fixed first-order signature. (i) Given a first-order theory or ground theory T over of Turing degree , a program...
Dexter Kozen
124
Voted
CORR
2006
Springer
150views Education» more  CORR 2006»
15 years 4 months ago
The approximability of MAX CSP with fixed-value constraints
In the maximum constraint satisfaction problem (Max CSP), one is given a finite collection of (possibly weighted) constraints on overlapping sets of variables, and the goal is to ...
Vladimir G. Deineko, Peter Jonsson, Mikael Klasson...