Sciweavers

5105 search results - page 63 / 1021
» An algorithm to determine peer-reviewers
Sort
View
SOFSEM
2012
Springer
13 years 8 months ago
Recent Challenges and Ideas in Temporal Synthesis
In automated synthesis, we transform a specification into a system that is guaranteed to satisfy the specification against all environments. While modelchecking theory has led to...
Orna Kupferman
118
Voted
INFOCOM
2012
IEEE
13 years 2 months ago
Combinatorial auction with time-frequency flexibility in cognitive radio networks
—In this paper, we tackle the spectrum allocation problem in cognitive radio (CR) networks with time-frequency flexibility consideration using combinatorial auction. Different f...
Mo Dong, Gaofei Sun, Xinbing Wang, Qian Zhang
83
Voted
CORR
2008
Springer
99views Education» more  CORR 2008»
15 years 16 days ago
Decomposing replicable functions
We describe an algorithm to decompose rational functions from which we determine the poset of groups fixing these functions.
John McKay, David Sevilla
CAV
1998
Springer
130views Hardware» more  CAV 1998»
15 years 4 months ago
On Checking Model Checkers
It has become good practice to expect authors of new model checking algorithms to provide not only rigorous evidence of the algorithms correctness, but also evidence of their pract...
Gerard J. Holzmann
90
Voted
EKAW
2008
Springer
15 years 2 months ago
Towards a Rule-Based Matcher Selection
Abstract. The central problems w.r.t. interoperability and data integration issues in the Semantic Web are schema and ontology matching approaches. Today it takes an expert to dete...
Malgorzata Mochol, Anja Jentzsch