Sciweavers

270 search results - page 46 / 54
» Exploiting Problem Structure for Solution Counting
Sort
View
JAIR
2006
157views more  JAIR 2006»
13 years 7 months ago
Decision-Theoretic Planning with non-Markovian Rewards
A decision process in which rewards depend on history rather than merely on the current state is called a decision process with non-Markovian rewards (NMRDP). In decisiontheoretic...
Sylvie Thiébaux, Charles Gretton, John K. S...
IJRR
2006
126views more  IJRR 2006»
13 years 7 months ago
Market-based Multirobot Coordination for Complex Tasks
Current technological developments and application-driven demands are bringing us closer to the realization of autonomous multirobot systems performing increasingly complex missio...
Robert Zlot, Anthony Stentz
ICDE
2007
IEEE
219views Database» more  ICDE 2007»
14 years 9 months ago
Efficient Keyword Search Across Heterogeneous Relational Databases
Keyword search is a familiar and potentially effective way to find information of interest that is "locked" inside relational databases. Current work has generally assum...
Mayssam Sayyadian, Hieu LeKhac, AnHai Doan, Luis G...
IAT
2009
IEEE
14 years 2 months ago
Computing Information Minimal Match Explanations for Logic-Based Matchmaking
Abstract—In semantic matchmaking processes it is often useful, when the obtained match is not full, to provide explanations for the mismatch, to leverage further interaction and/...
Tommaso Di Noia, Eugenio Di Sciascio, Francesco M....
IAT
2009
IEEE
14 years 2 months ago
Social Trust-Aware Recommendation System: A T-Index Approach
Collaborative Filtering based on similarity suffers from a variety of problems such as sparsity and scalability. In this paper, we propose an ontological model of trust between us...
Alireza Zarghami, Soude Fazeli, Nima Dokoohaki, Mi...