Sciweavers

209 search results - page 32 / 42
» Decomposable Constraints
Sort
View
FASE
2010
Springer
13 years 11 months ago
Incremental Service Composition Based on Partial Matching of Visual Contracts
Services provide access to software components that can be discovered dynamically via the Internet. The increasing number of services a requesters may be able to use demand support...
Muhammad Naeem, Reiko Heckel, Fernando Orejas, Fra...
FLAIRS
2007
13 years 10 months ago
Pursuing the Best ECOC Dimension for Multiclass Problems
Recent work highlights advantages in decomposing multiclass decision problems into multiple binary problems. Several strategies have been proposed for this decomposition. The most...
Edgar Pimenta, João Gama, André Carl...
EMSOFT
2008
Springer
13 years 9 months ago
Disassembling real-time fault-tolerant programs
We focus on decomposition of hard-masking real-time faulttolerant programs (where safety, timing constraints, and liveness are preserved in the presence of faults) that are design...
Borzoo Bonakdarpour, Sandeep S. Kulkarni, Anish Ar...
AAAI
2006
13 years 9 months ago
DNNF-based Belief State Estimation
As embedded systems grow increasingly complex, there is a pressing need for diagnosing and monitoring capabilities that estimate the system state robustly. This paper is based on ...
Paul Elliott, Brian C. Williams
CORR
2008
Springer
124views Education» more  CORR 2008»
13 years 7 months ago
Scheduling Kalman Filters in Continuous Time
A set of N independent Gaussian linear time invariant systems is observed by M sensors whose task is to provide the best possible steady-state causal minimum mean square estimate o...
Jerome Le Ny, Eric Feron, Munther A. Dahleh