Sciweavers

3757 search results - page 577 / 752
» The overlap number of a graph
Sort
View
WICON
2008
15 years 7 months ago
On the practical complexity of solving the maximum weighted independent set problem for optimal scheduling in wireless networks
It is well known that the maximum weighted independent set (MWIS) problem is NP-complete. Moreover, optimal scheduling in wireless networks requires solving a MWIS problem. Conseq...
Peng Wang, Stephan Bohacek
AAAI
2004
15 years 7 months ago
Comparing Cognitive and Computational Models of Narrative Structure
A growing number of applications seek to incorporate automatically generated narrative structure into interactive virtual environments. In this paper, we evaluate a representation...
David B. Christian, R. Michael Young
AAAI
2006
15 years 7 months ago
Improved Bounds for Computing Kemeny Rankings
Voting (or rank aggregation) is a general method for aggregating the preferences of multiple agents. One voting rule of particular interest is the Kemeny rule, which minimizes the...
Vincent Conitzer, Andrew J. Davenport, Jayant Kala...
AAAI
2006
15 years 7 months ago
Cost-Optimal External Planning
This paper considers strategies for external memory based optimal planning. An external breadth-first search exploration algorithm is devised that is guaranteed to find the costop...
Stefan Edelkamp, Shahid Jabbar
AAAI
2004
15 years 7 months ago
Shortest Path Discovery Problems: A Framework, Algorithms and Experimental Results
In this paper we introduce and study Shortest Path Discovery (SPD) problems, a generalization of shortest path problems: In SPD one is given a directed edgeweighted graph and the ...
Csaba Szepesvári