3875 search results - page 674 / 775 » Approximation algorithms for the 0-extension problem |
TACAS
2007
Springer
15 years 4 months ago
2007
Springer
We study and provide efficient algorithms for multi-objective model checking problems for Markov Decision Processes (MDPs). Given an MDP, M, and given multiple linear-time (ω-regu...
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
Given concentrations of metabolites over a sequence of time steps, the metabolic pathway prediction problem seeks a set of reactions and rate constants for them that could yield t...
111
click to vote
AAAI
2010
14 years 11 months ago
2010
Forming effective coalitions is a major research challenge in AI and multi-agent systems (MAS). Coalition Structure Generation (CSG) involves partitioning a set of agents into coa...
177
click to vote
ICDE
2007
IEEE
15 years 11 months ago
2007
IEEE
In spite of the great progress in the data mining field in recent years, the problem of missing and uncertain data has remained a great challenge for data mining algorithms. Many ...
STACS
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. We study computationally hard combinatorial problems arising from the important engineering question of how to maximize the number of connections that can be simultaneous...