1232 search results - page 17 / 247 » Digraphs: theory, algorithms and applications |
ICTAI
2000
IEEE
14 years 4 days ago
2000
IEEE
This paper presents a problem-independent framework that uni es various mechanisms for solving discrete constrained nonlinear programming (NLP) problems whose functions are not ne...
ICML
2010
IEEE
13 years 8 months ago
2010
IEEE
We consider the general, widely applicable problem of selecting from n real-valued random variables a subset of size m of those with the highest means, based on as few samples as ...
GIAE
2004
Springer
14 years 1 months ago
2004
Springer
This paper surveys the new, algorithmic theory of moving frames developed by the author and M. Fels. Applications in geometry, computer vision, classical invariant theory, the cal...
STOC
2003
ACM
14 years 8 months ago
2003
ACM
Let H be a fixed directed graph on h vertices, let G be a directed graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it H-free. We show tha...
ILP
2003
Springer
14 years 28 days ago
2003
Springer
This work presents the application of theory revision to the design of distributed databases to automatically revise a heuristic-based algorithm (called analysis algorithm) through...