Sciweavers

576 search results - page 58 / 116
» Matching methodology to problem domain
Sort
View
ATAL
2010
Springer
15 years 6 months ago
Risk-sensitive planning in partially observable environments
Partially Observable Markov Decision Process (POMDP) is a popular framework for planning under uncertainty in partially observable domains. Yet, the POMDP model is riskneutral in ...
Janusz Marecki, Pradeep Varakantham
IPPS
2006
IEEE
15 years 11 months ago
Effecting parallel graph eigensolvers through library composition
— Many interesting problems in graph theory can be reduced to solving an eigenproblem of the adjacency matrix or Laplacian of a graph. Given the availability of high-quality line...
A. Breuer, Peter Gottschling, Douglas Gregor, Andr...
FOCS
2005
IEEE
15 years 10 months ago
Truthful and Near-Optimal Mechanism Design via Linear Programming
We give a general technique to obtain approximation mechanisms that are truthful in expectation. We show that for packing domains, any α-approximation algorithm that also bounds ...
Ron Lavi, Chaitanya Swamy
ICTAI
2002
IEEE
15 years 10 months ago
A Clustering Based Approach to Efficient Image Retrieval
This paper addresses the issue of effective and efficient content based image retrieval by presenting a novel indexing and retrieval methodology that integrates color, texture, an...
Ruofei Zhang, Zhongfei Zhang
AIPS
2006
15 years 6 months ago
Evaluating Mixed-Initiative Systems: An Experimental Approach
Mixed-Initiative approaches to Planning and Scheduling are being applied in different real world domains. While several recent successful examples of such tools encourage a wider ...
Gabriella Cortellessa, Amedeo Cesta