Sciweavers

6455 search results - page 70 / 1291
» Research problems
Sort
View
DSN
2006
IEEE
15 years 8 months ago
The Startup Problem in Fault-Tolerant Time-Triggered Communication
Fault-tolerant time-triggered communication relies on the synchronization of local clocks. The startup problem is the problem of reaching a sufficient degree of synchronization a...
Wilfried Steiner, Hermann Kopetz
CPAIOR
2007
Springer
15 years 8 months ago
Preprocessing Expression-Based Constraint Satisfaction Problems for Stochastic Local Search
Abstract. This work presents methods for processing a constraint satisfaction problem (CSP) formulated by an expression-based language, before the CSP is presented to a stochastic ...
Sivan Sabato, Yehuda Naveh
TIME
1998
IEEE
15 years 6 months ago
Tackling the Qualification Problem using Fluent Dependency Constraints: Preliminary Report
The use of causal rules or fluent dependency constraints has proven to provide a versatile means of dealing with the ramification problem. In this paper we show how fluent depende...
Patrick Doherty, Jonas Kvarnström
ICALT
2003
IEEE
15 years 7 months ago
Real-Time Collaborative Problem Solving: A Study on Alternative Coordination Mechanisms
It is believed that computer-supported collaboration at a distance can stimulate learning. In this paper an innovative environment that permits real-time collaborative problem sol...
Nikolaos M. Avouris, Meletis Margaritis, Vassilis ...
ISCAS
2003
IEEE
116views Hardware» more  ISCAS 2003»
15 years 7 months ago
Using FPGAs to solve the Hamiltonian cycle problem
The Hamiltonian Cycle (HC) problem is an important graph problem with many applications. The general backtracking algorithm normally used for random graphs often takes far too lon...
Micaela Serra, Kenneth B. Kent