Sciweavers

3433 search results - page 417 / 687
» Heuristics for a bidding problem
Sort
View
ECCC
2007
99views more  ECCC 2007»
15 years 6 months ago
An Exponential Time/Space Speedup For Resolution
Satisfiability algorithms have become one of the most practical and successful approaches for solving a variety of real-world problems, including hardware verification, experime...
Philipp Hertel, Toniann Pitassi
AAMAS
2005
Springer
15 years 6 months ago
Efficient Management of Multi-Linked Negotiation Based on a Formalized Model
A Multi-linked negotiation problem occurs when an agent needs to negotiate with multiple other agents about different subjects (tasks, conflicts, or resource requirements), and th...
Xiaoqin Zhang, Victor R. Lesser, Sherief Abdallah
DKE
2007
156views more  DKE 2007»
15 years 6 months ago
Efficient index and data allocation for wireless broadcast services
The periodic broadcasting of frequently requested data can reduce the workload of uplink channels and improve data access for users in a wireless network. Since mobile devices hav...
Shou-Chih Lo, Arbee L. P. Chen
JAIR
2000
152views more  JAIR 2000»
15 years 6 months ago
Value-Function Approximations for Partially Observable Markov Decision Processes
Partially observable Markov decision processes (POMDPs) provide an elegant mathematical framework for modeling complex decision and planning problems in stochastic domains in whic...
Milos Hauskrecht
JACM
2002
94views more  JACM 2002»
15 years 6 months ago
The greedy path-merging algorithm for contig scaffolding
Given a collection of contigs and mate-pairs. The Contig Scaffolding Problem is to order and orientate the given contigs in a manner that is consistent with as many mate-pairs as p...
Daniel H. Huson, Knut Reinert, Eugene W. Myers