Sciweavers

4797 search results - page 232 / 960
» The complexity of partition tasks
Sort
View
RTCSA
2006
IEEE
16 years 16 days ago
Computing the Minimum EDF Feasible Deadline in Periodic Systems
In most real-time applications, deadlines are artifices that need to be enforced to meet different performance requirements. For example, in periodic task sets, jitter requiremen...
Hoai Hoang, Giorgio C. Buttazzo, Magnus Jonsson, S...
AADEBUG
2005
Springer
16 years 2 days ago
Debugging object-oriented programs with behavior views
A complex software system may perform many program tasks during execution to provide the required functionalities. To detect and localize bugs related to the implementation of the...
Donglin Liang, Kai Xu 0002
TPDS
2002
112views more  TPDS 2002»
15 years 6 months ago
Performance Analysis of a Distributed Question/Answering System
The problem of question/answering (Q/A) is to find answers to open-domain questions by searching large collections of documents. Unlike information retrieval systems, very common ...
Mihai Surdeanu, Dan I. Moldovan, Sanda M. Harabagi...
DEXAW
2003
IEEE
106views Database» more  DEXAW 2003»
15 years 11 months ago
How to Program Pervasive Systems
As users, computers, data and processes become increasingly mobile and the diversity of interacting devices increases, pervasive computing tasks are difficult to predict and to u...
Andry Rakotonirainy
ECAI
2006
Springer
15 years 10 months ago
Polynomial Conditional Random Fields for Signal Processing
We describe Polynomial Conditional Random Fields for signal processing tasks. It is a hybrid model that combines the ability of Polynomial Hidden Markov models for modeling complex...
Trinh Minh Tri Do, Thierry Artières