1219 search results - page 76 / 244 » Where to Look Next |
105
click to vote
FSTTCS
2008
Springer
15 years 5 months ago
2008
Springer
We consider the problem of maintaining information about the rank of a matrix M under changes to its entries. For an n × n matrix M, we show an amortized upper bound of O(nω−1)...
144
click to vote
IAT
2008
IEEE
15 years 4 months ago
2008
IEEE
Use of game-theoretic models to address patrolling applications has gained increasing interest in the very last years. The patrolling agent is considered playing a game against an...
156
click to vote
AML
2010
15 years 4 months ago
2010
Let L be a propositional language with standard Boolean connectives plus two modalities: an S4-ish topological modality and a temporal modality , understood as `next'. We ext...
117
click to vote
AUTOMATICA
2008
15 years 4 months ago
2008
In this paper, we present an analysis and synthesis framework for guaranteeing that the phase of a single-input, single-output closed-loop transfer function is contained in the int...
129
Voted
AML
2006
15 years 4 months ago
2006
Abstract Let L be a propositional language with standard Boolean connectives plus two modalities: an S4-ish topological modality and a temporal modality , understood as `next'...