5393 search results - page 441 / 1079 » Spatial Computing with Labels |
206
Voted
ICML
2009
IEEE
16 years 2 months ago
2009
IEEE
In classification with monotonicity constraints, it is assumed that the class label should increase with increasing values on the attributes. In this paper we aim at formalizing ...
168
Voted
ESOP
2009
Springer
16 years 2 months ago
2009
Springer
The operational semantics of interactive systems is usually d by labeled transition systems. Abstract semantics is defined in terms of bisimilarity that, in the finite case, can ...
215
Voted
CEC
2009
IEEE
16 years 2 months ago
2009
IEEE
— Many real-world problems are dynamic, requiring an optimization algorithm which is able to continuously track a changing optimum over time. In this paper, we present a stigmerg...
200
Voted
ICALP
2007
Springer
16 years 1 months ago
2007
Springer
A data tree is a tree where each node has a label from a finite set, and a data value from a possibly infinite set. We consider data trees whose depth is bounded beforehand. By d...
201
click to vote
FOSSACS
2005
Springer
16 years 1 months ago
2005
Springer
A timed extension of π-calculus with a transaction construct – the calculus webπ – is studied. The underlying model of webπ relies on networks of processes; time proceeds as...