Sciweavers

9626 search results - page 488 / 1926
» Invariant Based Programming
Sort
View
AIPS
2008
15 years 10 months ago
Learning Heuristic Functions through Approximate Linear Programming
Planning problems are often formulated as heuristic search. The choice of the heuristic function plays a significant role in the performance of planning systems, but a good heuris...
Marek Petrik, Shlomo Zilberstein
AIPS
2008
15 years 10 months ago
Exact Dynamic Programming for Decentralized POMDPs with Lossless Policy Compression
High dimensionality of belief space in DEC-POMDPs is one of the major causes that makes the optimal joint policy computation intractable. The belief state for a given agent is a p...
Abdeslam Boularias, Brahim Chaib-draa
ANCS
2008
ACM
15 years 9 months ago
Design of a scalable network programming framework
Nearly all programmable commercial hardware solutions offered for high-speed networking systems are capable of meeting the performance and flexibility requirements of equipment ve...
Ben Wun, Patrick Crowley, Arun Raghunath
APN
2008
Springer
15 years 9 months ago
Process Discovery Using Integer Linear Programming
Abstract. The research domain of process discovery aims at constructocess model (e.g. a Petri net) which is an abstract representation of an execution log. Such a Petri net should ...
Jan Martijn E. M. van der Werf, Boudewijn F. van D...
ECAI
2008
Springer
15 years 9 months ago
Belief Revision through Forgetting Conditionals in Conditional Probabilistic Logic Programs
Abstract. In this paper, we present a revision strategy of revising a conditional probabilistic logic program (PLP) when new information is received (which is in the form of probab...
Anbu Yue, Weiru Liu