Sciweavers

9842 search results - page 112 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
WOTUG
2008
13 years 11 months ago
Solving the Santa Claus Problem: a Comparison of Various Concurrent Programming Techniques
Abstract. The Santa Claus problem provides an excellent exercise in concurrent programming and can be used to show the simplicity or complexity of solving problems using a particul...
Jason Hurt, Jan Bækgaard Pedersen
IJIT
2004
13 years 11 months ago
A Constructive Problem Solver Approach for Building Agriculture Disorder Treatment Task
Expert systems development is a complex and expensive process that needs to be applied in an organized manner. This paper presents an approach for building a generic treatment mode...
Abeer El-Korany, Ahmed A. Rafea
DKE
2006
93views more  DKE 2006»
13 years 10 months ago
The ramification problem in temporal databases: Changing beliefs about the past
In this paper we study the ramification problem in the setting of temporal databases. Standard solutions from the literature on reasoning about action are inadequate because they ...
Nikos Papadakis, Grigoris Antoniou, Dimitris Plexo...
JC
2011
102views more  JC 2011»
13 years 5 months ago
Tractability of tensor product problems in the average case setting
It has been an open problem to derive a necessary and sufficient condition for a linear tensor product problem S = {Sd} in the average case setting to be weakly tractable but not ...
Anargyros Papageorgiou, Iasonas Petras
DMTCS
2003
99views Mathematics» more  DMTCS 2003»
13 years 11 months ago
Combinatorial Problems Arising in SNP and Haplotype Analysis
It is widely anticipated that the study of variation in the human genome will provide a means of predicting risk of a variety of complex diseases. This paper presents a number of a...
Bjarni V. Halldórsson, Vineet Bafna, Nathan...