Sciweavers

2519 search results - page 42 / 504
» cost 2007
Sort
View
AAAI
2007
15 years 2 months ago
Domain-Independent Construction of Pattern Database Heuristics for Cost-Optimal Planning
Heuristic search is a leading approach to domain-independent planning. For cost-optimal planning, however, existing admissible heuristics are generally too weak to effectively gui...
Patrik Haslum, Adi Botea, Malte Helmert, Blai Bone...
IPL
2007
76views more  IPL 2007»
14 years 11 months ago
Minimum cost subpartitions in graphs
Given an edge-weighted graph G = (V,E), a subset S ⊆ V , an integer k 1 and a real b 0, the minimum subpartition problem asks to find a family of k nonempty disjoint subsets X1...
Hiroshi Nagamochi, Yoko Kamidoi
APPROX
2007
Springer
112views Algorithms» more  APPROX 2007»
15 years 6 months ago
Encouraging Cooperation in Sharing Supermodular Costs
Abstract Consider a situation where a group of agents wishes to share the costs of their joint actions, and needs to determine how to distribute the costs amongst themselves in a f...
Andreas S. Schulz, Nelson A. Uhan
IPPS
2007
IEEE
15 years 6 months ago
Invited Paper: A Compile-time Cost Model for OpenMP
OpenMP has gained wide popularity as an API for parallel programming on shared memory and distributed shared memory platforms. It is also a promising candidate to exploit the emer...
Chunhua Liao, Barbara M. Chapman
ICDE
2007
IEEE
111views Database» more  ICDE 2007»
16 years 1 months ago
Finding Top-k Min-Cost Connected Trees in Databases
It is widely realized that the integration of database and information retrieval techniques will provide users with a wide range of high quality services. In this paper, we study ...
Bolin Ding, Jeffrey Xu Yu, Shan Wang, Lu Qin, Xiao...