6833 search results - page 219 / 1367 » Some two-character sets |
175
click to vote
ICALP
2004
Springer
16 years 8 hour ago
2004
Springer
We consider the problem of learning a labeled graph from a given family of graphs on n vertices in a model where the only allowed operation is to query whether a set of vertices i...
136
click to vote
GECCO
2003
Springer
15 years 12 months ago
2003
Springer
This paper suggests dense and switched modular primitives for a bond-graph-based GP design framework that automatically synthesizes designs for multi-domain, lumped parameter dynam...
160
click to vote
ISAAC
2003
Springer
15 years 11 months ago
2003
Springer
Let T = (V, E, w) be an undirected and weighted tree with node set V and edge set E, where w(e) is an edge weight function for e ∈ E. The density of a path, say e1, e2, . . . , e...
170
click to vote
SWAT
2010
Springer
15 years 11 months ago
2010
Springer
We attend to the classic setting where an observer needs to inform a tracker about an arbitrary time varying function f : N0 → Z. This is an optimization problem, where both wron...
177
click to vote
ADAEUROPE
2001
Springer
15 years 11 months ago
2001
Springer
Deriving test cases from specifications is now recognised as a major application of formal methods to software development. Several methods have been proposed for various formalism...