908 search results - page 128 / 182 » Heuristic Methods for Solving Job-Shop Scheduling Problems |
150
click to vote
WIOPT
2010
IEEE
15 years 10 days ago
2010
IEEE
Abstract—We consider the problem of jointly optimizing random access and subgraph selection in coded wireless packet networks. As opposed to the corresponding scheduling approach...
131
click to vote
ATAL
2009
Springer
15 years 8 months ago
2009
Springer
Commitment-modeled protocols enable flexible and robust interactions among agents. However, existing work has focused on features and capabilities of protocols without considerin...
ATAL
2005
Springer
15 years 7 months ago
2005
Springer
This paper presents an agent strategy for complex bilateral negotiations over many issues with inter-dependent valuations. We use ideas inspired by graph theory and probabilistic ...
117
click to vote
IJCNLP
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. This paper proposes a method for detecting errors concerning article usage and singular/plural usage based on the mass count distinction. Although the mass count distinct...
118
click to vote
JAIR
2000
15 years 1 months ago
2000
Partially observable Markov decision processes (POMDPs) provide an elegant mathematical framework for modeling complex decision and planning problems in stochastic domains in whic...