1998 search results - page 282 / 400 » Complexity of the Cover Polynomial |
99
Voted
SIGMOD
2002
ACM
16 years 27 days ago
2002
ACM
Time-parameterized queries (TP queries for short) retrieve (i) the actual result at the time that the query is issued, (ii) the validity period of the result given the current mot...
108
click to vote
TACAS
2010
Springer
15 years 7 months ago
2010
Springer
Deciding whether a modal formula is satisfiable with respect to a given set of (global) assumptions is a question of fundamental importance in applications of logic in computer sc...
121
click to vote
APN
2009
Springer
15 years 7 months ago
2009
Springer
Web Service orchestrations are compositions of different Web Services to form a new service. The services called during the orchestration guarantee a given Quality of Service (QoS...
82
Voted
ITICSE
2009
ACM
15 years 7 months ago
2009
ACM
In general, university guidelines or policies on plagiarism are not sufficiently detailed to cope with the technical complexity of software. Software plagiarism can have a signi...
89
Voted
ICRA
2008
IEEE
15 years 7 months ago
2008
IEEE
Abstract— We report our algorithmic development of the pframe problem that addresses the need of coordinating a set of p networked robotic pan-tilt-zoom cameras for n, (n > p)...