4843 search results - page 824 / 969 » The Shortcut Problem - Complexity and Approximation |
149
click to vote
WIOPT
2005
IEEE
15 years 8 months ago
2005
IEEE
We consider the problem of transmission scheduling of data over a wireless fading channel with hard deadline constraints. Our system consists of N users, each with a fixed amount...
117
click to vote
KCAP
2005
ACM
15 years 8 months ago
2005
ACM
Anaphora occur commonly in natural language text, and resolving them is essential for capturing the knowledge encoded in text. Indirect anaphora are especially challenging to reso...
125
click to vote
APPROX
2005
Springer
15 years 8 months ago
2005
Springer
We consider the problem of finding a maximum independent set in a random graph. The random graph G, which contains n vertices, is modelled as follows. Every edge is included inde...
143
click to vote
ASP
2005
Springer
15 years 8 months ago
2005
Springer
The extended answer set semantics for simple logic programs, i.e. programs with only classical negation, allows for the defeat of rules to resolve contradictions. In addition, a pa...
117
click to vote
ECML
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. Learning to act in an unknown partially observable domain is a difficult variant of the reinforcement learning paradigm. Research in the area has focused on model-free m...