Sciweavers

1002 search results - page 35 / 201
» Constraint Answer Set Solving
Sort
View
KI
2007
Springer
13 years 7 months ago
Solving Decentralized Continuous Markov Decision Problems with Structured Reward
We present an approximation method that solves a class of Decentralized hybrid Markov Decision Processes (DEC-HMDPs). These DEC-HMDPs have both discrete and continuous state variab...
Emmanuel Benazera
ICDT
2003
ACM
202views Database» more  ICDT 2003»
14 years 1 months ago
Condensed Representation of Database Repairs for Consistent Query Answering
Abstract. Repairing a database means bringing the database in accordance with a given set of integrity constraints by applying modifications that are as small as possible. In the ...
Jef Wijsen
IJON
2008
177views more  IJON 2008»
13 years 8 months ago
An asynchronous recurrent linear threshold network approach to solving the traveling salesman problem
In this paper, an approach to solving the classical Traveling Salesman Problem (TSP) using a recurrent network of linear threshold (LT) neurons is proposed. It maps the classical ...
Eu Jin Teoh, Kay Chen Tan, H. J. Tang, Cheng Xiang...
VLDB
1994
ACM
149views Database» more  VLDB 1994»
14 years 2 days ago
Qualified Answers That Reflect User Needs and Preferences
This paper introduces a formalism to describe the needs and preferences of database users. Because of the precise formulation of these concepts, we have found an automatic and ver...
Terry Gaasterland, Jorge Lobo
AIMSA
2008
Springer
14 years 2 months ago
Solving the Course Timetabling Problem with a Hybrid Heuristic Algorithm
Abstract. The problem of curriculum-based course timetabling is studied in this work. In addition to formally defining the problem, we present a hybrid solution algorithm (Adaptiv...
Zhipeng Lü, Jin-Kao Hao