1723 search results - page 234 / 345 » Cycling in linear programming problems |
113
click to vote
FOSSACS
2006
Springer
15 years 1 months ago
2006
Springer
Chaitin proved that register allocation is equivalent to graph coloring and hence NP-complete. Recently, Bouchez, Brisk, and Hack have proved independently that the interference gr...
112
click to vote
CPM
1995
Springer
15 years 1 months ago
1995
Springer
We consider strings which are succinctly described. The description is in terms of straight-line programs in which the constants are symbols and the only operation is the concaten...
DASFAA
2008
IEEE
14 years 11 months ago
2008
IEEE
We study a novel problem of mining significant recurrent rules from a sequence database. Recurrent rules have the form "whenever a series of precedent events occurs, eventuall...
IJCAI
2003
14 years 11 months ago
2003
The problem of deriving joint policies for a group of agents that maximize some joint reward function can be modeled as a decentralized partially observable Markov decision proces...
ICASSP
2010
IEEE
14 years 10 months ago
2010
IEEE
Hyperspectral unmixing is a process of extracting hidden spectral signatures (or endmembers) and the corresponding proportions (or abundances) of a scene, from its hyperspectral o...