457 search results - page 42 / 92 » Upper and Lower Bounds on Continuous-Time Computation |
138
click to vote
COMBINATORICS
2000
15 years 5 months ago
2000
The set R of relevant cycles of a graph G is the union of its minimum cycle bases. We introduce a partition of R such that each cycle in a class W can be expressed as a sum of oth...
153
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
Abstract. We consider the issue of exploiting symmetries in the hierarchy of semidefinite programming relaxations recently introduced in polynomial optimization. We focus on probl...
148
Voted
ICCAD
2006
IEEE
16 years 3 months ago
2006
IEEE
Battery-powered wireless sensors are severely constrained by the amount of the available energy. A method for computing the energy budget per sensing task can be a valuable design...
150
click to vote
SIGECOM
2004
ACM
15 years 11 months ago
2004
ACM
For the problem of online real-time scheduling of jobs on a single processor, previous work presents matching upper and lower bounds on the competitive ratio that can be achieved ...
161
click to vote
ICALP
2007
Springer
16 years 7 days ago
2007
Springer
Abstract. The edit distance between two ordered rooted trees with vertex labels is the minimum cost of transforming one tree into the other by a sequence of elementary operations c...