Sciweavers

601 search results - page 48 / 121
» CSP(M): Constraint Satisfaction Problem over Models
Sort
View
CORR
1998
Springer
126views Education» more  CORR 1998»
15 years 1 months ago
Stable models and an alternative logic programming paradigm
In this paper we reexamine the place and role of stable model semantics in logic programming and contrast it with a least Herbrand model approach to Horn programs. We demonstrate ...
Victor W. Marek, Miroslaw Truszczynski
ICTAI
2007
IEEE
15 years 7 months ago
On Portfolios for Backtracking Search in the Presence of Deadlines
Constraint satisfaction and propositional satisfiability problems are often solved using backtracking search. Previous studies have shown that portfolios of backtracking algorith...
Huayue Wu, Peter van Beek
INFOCOM
2007
IEEE
15 years 7 months ago
QoS-Driven Power Allocation Over Parallel Fading Channels With Imperfect Channel Estimations in Wireless Networks
— We propose the quality-of-service (QoS) driven power allocation schemes for parallel fading channels when considering imperfect channel estimations. In particular, the parallel...
Jia Tang, Xi Zhang
IJSN
2006
87views more  IJSN 2006»
15 years 1 months ago
Workflow authorisation in mediator-free environments
: WorkFlow Management Systems (WFMS) coordinate and streamline business processes. Acquiring workflow authorisations and managing workflow authorisation constraints is achallenging...
Mohamed Shehab, Elisa Bertino, Arif Ghafoor
GMP
2006
IEEE
15 years 7 months ago
Simultaneous Precise Solutions to the Visibility Problem of Sculptured Models
Abstract. We present an efficient and robust algorithm for computing continuous visibility for two- or three-dimensional shapes whose boundaries are NURBS curves or surfaces by li...
Joon-Kyung Seong, Gershon Elber, Elaine Cohen