5326 search results - page 153 / 1066 » On what we can ensure |
175
click to vote
COMPGEOM
2009
ACM
16 years 28 days ago
2009
ACM
Color red and blue the n vertices of a convex polytope P in R3 . Can we compute the convex hull of each color class in o(n log n)? What if we have χ > 2 colors? What if the co...
185
click to vote
TACAS
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. We study schedulability problems of timed systems with nonuniformly recurring computation tasks. Assume a set of real time tasks whose best and worst execution times, and...
177
click to vote
ALIFE
2010
15 years 5 months ago
2010
We present a model of social learning of both language and skills, while assuming—insofar as possible—strict autonomy, virtual embodiment, and situatedness. This model is built...
210
click to vote
TCAD
2010
15 years 1 months ago
2010
The growing complexity of systems and their implementation into silicon encourages designers to look for model designs at higher levels of abstraction and then incrementally build ...
155
click to vote
ATAL
2005
Springer
15 years 12 months ago
2005
Springer
There is a wide agreement on the use of norms in order to specify the expected behaviour of agents in open MAS. However, in highly regulated domains, where norms dictate what can a...