Sciweavers

1677 search results - page 157 / 336
» On the Completeness of Quantum Computation Models
Sort
View
JAIR
2006
102views more  JAIR 2006»
15 years 6 months ago
Properties and Applications of Programs with Monotone and Convex Constraints
We study properties of programs with monotone and convex constraints. We extend to these formalisms concepts and results from normal logic programming. They include the notions of...
Lengning Liu, Miroslaw Truszczynski
ENTCS
2007
99views more  ENTCS 2007»
15 years 6 months ago
Nominal Equational Logic
This paper studies the notion of “freshness” that often occurs in the meta-theory of computer science languages involving various kinds of names. Nominal Equational Logic is a...
Ranald A. Clouston, Andrew M. Pitts
SCHEDULING
2010
137views more  SCHEDULING 2010»
15 years 5 months ago
Criticality analysis of activity networks under interval uncertainty
This paper reconsiders the PERT scheduling problem when information about task duration is incomplete. We model uncertainty on task durations by intervals. With this problem formu...
Jérôme Fortin, Pawel Zielinski, Didie...
ECCV
2004
Springer
16 years 8 months ago
Audio-Video Integration for Background Modelling
This paper introduces a new concept of surveillance, namely, audio-visual data integration for background modelling. Actually, visual data acquired by a fixed camera can be easily ...
Marco Cristani, Manuele Bicego, Vittorio Murino
ACSC
2005
IEEE
16 years 6 days ago
A Pedagogical Evaluation of New State Model Diagrams for Teaching Internetwork Technologies
Curriculum based on internetworking devices is primarily based on the Command Line Interface (CLI) and case studies. However a single CLI command may produce output that is not on...
Stanislaw P. Maj, G. Kohli, T. Fetherston