Sciweavers

747 search results - page 28 / 150
» Consequence Relations In DRT
Sort
View
MFCS
2007
Springer
14 years 1 months ago
Combinatorial Proof that Subprojective Constraint Satisfaction Problems are NP-Complete
Abstract. We introduce a new general polynomial-time constructionthe fibre construction- which reduces any constraint satisfaction problem CSP(H) to the constraint satisfaction pr...
Jaroslav Nesetril, Mark H. Siggers
CORR
2006
Springer
110views Education» more  CORR 2006»
13 years 7 months ago
Methods for Partitioning Data to Improve Parallel Execution Time for Sorting on Heterogeneous Clusters
The aim of the paper is to introduce general techniques in order to optimize the parallel execution time of sorting on a distributed architectures with processors of various speeds...
Christophe Cérin, Jean-Christophe Dubacq, J...
WWW
2005
ACM
14 years 8 months ago
Migrating web application sessions in mobile computing
The capability to change user agent while working is starting to appear in state of the art mobile computing due to the proliferation of different kinds of devices, ranging from p...
Gerardo Canfora, Giuseppe Di Santo, Gabriele Ventu...
LANMR
2004
13 years 9 months ago
Some Key Notions in Non-monotonic Reasoning
This paper explores the role of some basic notions in the study of non-monotonic reasoning, such as validity, logical consequence, context, rules and assumptions.1 It offers some ...
Raymundo Morado
ORGSCI
2010
92views more  ORGSCI 2010»
13 years 6 months ago
Are Technology-Intensive Industries More Dynamically Competitive? No and Yes
A growing body of research in management and related public policy fields concludes that the 1980s and 1990s saw greater dynamic competition throughout technology−intensive (“...
Paul M. Vaaler, Gerry McNamara