Sciweavers

72 search results - page 12 / 15
» Minimal Contraction of Preference Relations
Sort
View
RTCSA
2008
IEEE
14 years 4 months ago
Maximizing the Fault Tolerance Capability of Fixed Priority Schedules
Real-time systems typically have to satisfy complex requirements, mapped to the task attributes, eventually guaranteed by the underlying scheduler. These systems consist of a mix ...
Radu Dobrin, Hüseyin Aysan, Sasikumar Punnekk...
SSDBM
2008
IEEE
177views Database» more  SSDBM 2008»
14 years 4 months ago
Prioritized Evaluation of Continuous Moving Queries over Streaming Locations
Abstract. Existing approaches to the management of streaming positional updates generally assume that all active user requests have equal importance, ignoring the possibility of an...
Kostas Patroumpas, Timos K. Sellis
JNCA
2007
77views more  JNCA 2007»
13 years 9 months ago
A web content manipulation technique based on page Fragmentation
Web portals today offer a variety of content and services to their users. This content can be split into various categories and usually content semantically related is placed in t...
Christos Bouras, Giorgos Kounenis, Ioannis Misedak...
CORR
2010
Springer
157views Education» more  CORR 2010»
13 years 8 months ago
Active Integrity Constraints and Revision Programming
We study active integrity constraints and revision programming, two formalisms designed to describe integrity constraints on databases and to specify policies on preferred ways to...
Luciano Caroprese, Miroslaw Truszczynski
CICLING
2007
Springer
14 years 3 months ago
Finite-State Technology as a Programming Environment
Finite-state technology is considered the preferred model for representing the phonology and morphology of natural languages. The attractiveness of this technology for natural lang...
Shuly Wintner