Sciweavers

1254 search results - page 58 / 251
» Making Hard Problems Harder
Sort
View
CDC
2009
IEEE
139views Control Systems» more  CDC 2009»
14 years 13 days ago
Stabilization of networked control systems via non-monotone control ^lyapunov functions
— This paper deals with stabilization of networked control systems (NCS) affected by uncertain time-varying delays and data packet dropouts. We point out that such network effect...
Rob H. Gielen, Mircea Lazar
AAAI
2008
13 years 10 months ago
A New Incomplete Method for CSP Inconsistency Checking
Checking CSP consistency is shown, in theory, to be an NP-complete problem. There is two families of methods for CSP consistency checking. The first family holds the complete meth...
Belaid Benhamou, Mohamed Réda Saïdi
SEBD
2007
113views Database» more  SEBD 2007»
13 years 9 months ago
Conditional Preferences: A New Semantics for Database Queries
Preference queries aim to retrieve from large databases those objects that better match user’s requirements. Approaches proposed so far in the DB field for specifying preference...
Paolo Ciaccia
MT
1998
69views more  MT 1998»
13 years 7 months ago
Bilingual Sentence Alignment: Balancing Robustness and Accuracy
Sentence alignment is the problem of making explicit the relations that exist between the sentences of two texts that are known to be mutual translations. Automatic sentence align...
Michel Simard, Pierre Plamondon
ECRTS
2009
IEEE
13 years 5 months ago
Precise Worst-Case Execution Time Analysis for Processors with Timing Anomalies
This paper explores timing anomalies in WCET analysis. Timing anomalies add to the complexity of WCET analysis and make it hard to apply divide-and-conquer strategies to simplify ...
Raimund Kirner, Albrecht Kadlec, Peter P. Puschner