Sciweavers

4744 search results - page 493 / 949
» Connected Computing
Sort
View
AI
2006
Springer
15 years 6 months ago
Solving logic program conflict through strong and weak forgettings
We consider how to forget a set of atoms in a logic program. Intuitively, when a set of atoms is forgotten from a logic program, all atoms in the set should be eliminated from thi...
Yan Zhang, Norman Y. Foo
EJC
2008
15 years 6 months ago
Generalised dualities and maximal finite antichains in the homomorphism order of relational structures
The motivation for this paper is three-fold. First, we study the connectivity properties of the homomorphism order of directed graphs, and more generally for relational structures...
Jan Foniok, Jaroslav Nesetril, Claude Tardif
CAGD
2006
97views more  CAGD 2006»
15 years 6 months ago
Conditions for use of a non-selfintersection conjecture
Abstract. Volino and Thalmann have published a conjecture proposing sufficient conditions for non-selfintersection of surfaces. Such conditions may be used in solid modeling, compu...
Lars-Erik Andersson, Neil F. Stewart, Malika Zidan...
174
Voted
CORR
2006
Springer
70views Education» more  CORR 2006»
15 years 6 months ago
Scalable Algorithms for Aggregating Disparate Forecasts of Probability
- In this paper, computational aspects of the panel aggregation problem are addressed. Motivated primarily by applications of risk assessment, an algorithm is developed for aggrega...
Joel B. Predd, Sanjeev R. Kulkarni, Daniel N. Oshe...
EOR
2006
75views more  EOR 2006»
15 years 6 months ago
A rolling stock circulation model for combining and splitting of passenger trains
This paper addresses the railway rolling stock circulation problem. Given the departure and arrival times as well as the expected numbers of passengers, we have to assign the roll...
Pieter-Jan Fioole, Leo G. Kroon, Gábor Mar&...