108 search results - page 8 / 22 » ILP for Mathematical Discovery |
WCET
2003
13 years 8 months ago
2003
Worst-Case Execution Time (WCET) analysis means to compute a safe upper bound to the execution time of a piece of code. Parametric WCET analysis yields symbolic upper bounds: expr...
ICDCSW
2006
IEEE
14 years 1 months ago
2006
IEEE
In this paper we present a gossip based protocol for path discovery in Mobile Ad Hoc Networks (MANETs). While in the classical gossip algorithm each node forwards a packet with th...
PKDD
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. This paper presents a lattice-based visual metaphor for knowledge discovery in electronic mail. It allow a user to navigate email using a visual lattice metaphor rather t...
ACMSE
2005
ACM
14 years 1 months ago
2005
ACM
Recent research suggests that most of the real-world random networks organize themselves into communities. Communities are formed by subsets of nodes in a graph, which are closely...
BIRTHDAY
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. We present a succinct account of dynamic rippling, a technique used to guide the automation of inductive proofs. This simplifies termination proofs for rippling and hence...