Sciweavers

999 search results - page 73 / 200
» Constraints in Non-Boolean Contexts
Sort
View
JCP
2006
91views more  JCP 2006»
15 years 6 months ago
The Matching Predicate and a Filtering Scheme Based on Matroids
Finding a maximum cardinality matching in a graph is a problem appearing in numerous settings. The problem asks for a set of edges of maximum cardinality, such that no two edges of...
Dimitris Magos, Ioannis Mourtos, Leonidas S. Pitso...
TON
2002
99views more  TON 2002»
15 years 6 months ago
Computing shortest paths for any number of hops
In this paper we introduce and investigate a new" path optimization problem which we denote as the All Hops Optimal Path AHOP problem. The problem involves identifying, for a...
Roch Guérin, Ariel Orda
SENSYS
2010
ACM
15 years 4 months ago
Meeting ecologists' requirements with adaptive data acquisition
Ecologists instrument ecosystems to collect time series representing the evolution in time and space of relevant abiotic and biotic factors. Sensor networks promise to improve on ...
Marcus Chang, Philippe Bonnet
POPL
2012
ACM
14 years 1 months ago
A language for automatically enforcing privacy policies
It is becoming increasingly important for applications to protect sensitive data. With current techniques, the programmer bears the burden of ensuring that the application’s beh...
Jean Yang, Kuat Yessenov, Armando Solar-Lezama
ICCAD
1998
IEEE
94views Hardware» more  ICCAD 1998»
15 years 10 months ago
Noise considerations in circuit optimization
Noise can cause digital circuits to switch incorrectly and thus produce spurious results. Noise can also have adverse power, timing and reliability e ects. Dynamic logic is partic...
Andrew R. Conn, Ruud A. Haring, Chandramouli Viswe...