91 search results - page 6 / 19 » A dynamic inequality generation scheme for polynomial progra... |
RSA
2008
14 years 9 months ago
2008
We present an expected polynomial time algorithm to generate an unlabeled connected cubic planar graph uniformly at random. We first consider rooted connected cubic planar graphs, ...
109
click to vote
ICALP
1998
Springer
15 years 1 months ago
1998
Springer
Interval Routing Schemes (IRS for short) have been extensively investigated in the past years with special emphasis on shortest paths. Besides their theoretical interest, IRS have...
AUTOMATICA
1999
14 years 9 months ago
1999
This paper proposes a framework for modeling and controlling systems described by interdependent physical laws, logic rules, and operating constraints, denoted as mixed logical dy...
CGO
2010
IEEE
15 years 4 months ago
2010
IEEE
Tiling, a key transformation for optimizing programs, has been widely studied in literature. Parameterized tiled code is important for auto-tuning systems since they often execute...
89
Voted
MICRO
2003
IEEE
15 years 2 months ago
2003
IEEE
A dynamic optimizer is a runtime software system that groups a program’s instruction sequences into traces, optimizes those traces, stores the optimized traces in a softwarebase...