Sciweavers

3820 search results - page 290 / 764
» Bounded Model Debugging
Sort
View
PRDC
2002
IEEE
15 years 8 months ago
Detecting Feature Interactions in Telecommunication Services with a SAT Solver
Feature interaction is a kind of inconsistent conflict between multiple communication services and considered an obstacle to developing reliable telephony systems. In this paper ...
Tatsuhiro Tsuchiya, Masahide Nakamura, Tohru Kikun...
LPAR
2001
Springer
15 years 8 months ago
Logical Omniscience and the Cost of Deliberation
Logical omniscience is a well known problem which makes traditional modal logics of knowledge, belief and intentions somewhat unrealistic from the point of view of modelling the be...
Natasha Alechina, Brian Logan
119
Voted
WDAG
2001
Springer
76views Algorithms» more  WDAG 2001»
15 years 8 months ago
An Effective Characterization of Computability in Anonymous Networks
We provide effective (i.e., recursive) characterizations of the relations that can be computed on networks where all processors use the same algorithm, start from the same state, a...
Paolo Boldi, Sebastiano Vigna
128
Voted
PODC
1999
ACM
15 years 8 months ago
Computing Anonymously with Arbitrary Knowledge
We provide characterizations of the relations that can be computed with arbitrary knowledge on networks where all processors use the same algorithm and start from the same state (...
Paolo Boldi, Sebastiano Vigna
MCU
2007
95views Hardware» more  MCU 2007»
15 years 5 months ago
Slightly Beyond Turing's Computability for Studying Genetic Programming
Inspired by genetic programming (GP), we study iterative algorithms for non-computable tasks and compare them to naive models. This framework justifies many practical standard tri...
Olivier Teytaud