2143 search results - page 271 / 429 » corr 2010 |
171
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We discuss the definability of finite graphs in first-order logic with two relation symbols for adjacency and equality of vertices. The logical depth D(G) of a graph G is equal to ...
191
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
A polynomial identity testing algorithm must determine whether an input polynomial (given for instance by an arithmetic circuit) is identically equal to 0. In this paper, we show ...
164
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
c Modular Abstractions for Template Numerical Constraints David Monniaux May 26, 2010 We propose a method for automatically generating abstract transformstatic analysis by abstrac...
172
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We consider the optimal packet scheduling problem in a single-user energy harvesting wireless communication system. In this system, both the data packets and the harvested energy ...
118
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. One of the fastest evolving field among teaching and learning research is students' performance evaluation. Computer based testing systems are increasingly adopted b...