1232 search results - page 7 / 247 » Digraphs: theory, algorithms and applications |
EOR
2010
14 years 11 months ago
2010
Semidefinite Programming (SDP) may be seen as a generalization of Linear Programming (LP). In particular, one may extend interior point algorithms for LP to SDP, but it has proven...
RTAS
2008
IEEE
15 years 6 months ago
2008
IEEE
Multiprocessor scheduling problems are hard because of the numerous constraints on valid schedules to take into account. This paper presents new schedule representations in order ...
76
Voted
ISSAC
1998
Springer
15 years 4 months ago
1998
Springer
The subresultant theory for univariate commutative polynomials is generalized to Ore polynomials. The generalization includes: the subresultant theorem, gap structure, and subresu...
115
click to vote
AAAI
2012
13 years 2 months ago
2012
The multiagent systems community has adopted game theory as a framework for the design of systems of multiple self-interested agents. For this to be effective, efficient algorith...
PODS
2003
ACM
15 years 12 months ago
2003
ACM
Computing frequent itemsets and maximally frequent itemsets in a database are classic problems in data mining. The resource requirements of all extant algorithms for both problems...