Sciweavers

2266 search results - page 386 / 454
» Some Solutions to the Ignoring Problem
Sort
View
FAC
2008
100views more  FAC 2008»
15 years 4 months ago
Slicing communicating automata specifications: polynomial algorithms for model reduction
Abstract. Slicing is a program analysis technique that was originally introduced to improve program debugging and understanding. The purpose of a slicing algorithm is to remove the...
Sébastien Labbé, Jean-Pierre Gallois
CCR
2006
154views more  CCR 2006»
15 years 4 months ago
Medium access control issues in sensor networks
Medium access control for wireless sensor networks has been a very active research area for the past couple of years. The sensor networks literature presents an alphabet soup of m...
Muneeb Ali, Umar Saif, Adam Dunkels, Thiemo Voigt,...
JAIR
2006
87views more  JAIR 2006»
15 years 4 months ago
Fault Tolerant Boolean Satisfiability
A -model is a satisfying assignment of a Boolean formula for which any small alteration, such as a single bit flip, can be repaired by flips to some small number of other bits, yi...
Amitabha Roy
JAIR
2006
74views more  JAIR 2006»
15 years 4 months ago
Understanding Algorithm Performance on an Oversubscribed Scheduling Application
The best performing algorithms for a particular oversubscribed scheduling application, Air Force Satellite Control Network (AFSCN) scheduling, appear to have little in common. Yet...
Laura Barbulescu, Adele E. Howe, L. Darrell Whitle...
JSCIC
2008
148views more  JSCIC 2008»
15 years 4 months ago
Finite Element-Based Level Set Methods for Higher Order Flows
In this paper we shall discuss the numerical simulation of higher order geometric flows by level set methods. Main examples under considerations are surface diffusion and the Will...
Martin Burger, Christina Stöcker, Axel Voigt