3946 search results - page 535 / 790 » The computational complexity of choice sets |
196
click to vote
ICFEM
1997
Springer
15 years 11 months ago
1997
Springer
A real-time computer system is a system that must perform its functions within specified time bounds. These systems are generally characterized by complex interactions with the en...
165
click to vote
ICLP
1997
Springer
15 years 11 months ago
1997
Springer
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
175
click to vote
COMPGEOM
1993
ACM
15 years 10 months ago
1993
ACM
We give a practical and provably good Monte Carlo algorithm for approximating center points. Let P be a set of n points in IRd . A point c ∈ IRd is a β-center point of P if eve...
187
click to vote
KGC
1993
Springer
15 years 10 months ago
1993
Springer
We establish the complexity of decision problems associated with the nonmonotonic modal logic S4. We prove that the problem of existence of an S4-expansion for a given set A of pr...
183
click to vote
MAAMAW
1993
Springer
15 years 10 months ago
1993
Springer
Autonomous agents working in multi-agent environments may need to cooperate in order to ful ll tasks. Given a set of agents and a set of tasks which they have to satisfy, we consi...