Sciweavers

920 search results - page 95 / 184
» Computing the Frequency of Partial Orders
Sort
View
AGP
1994
IEEE
15 years 2 months ago
What the Event Calculus actually does, and how to do it efficiently
Kowalski and Sergot's Event Calculus (EC) is a formalism for reasoning about time and change in a logic programming framework. From a description of events which occur in the...
Iliano Cervesato, Luca Chittaro, Angelo Montanari
COR
2010
129views more  COR 2010»
14 years 8 months ago
Flexible solutions in disjunctive scheduling: General formulation and study of the flow-shop case
We consider the context of decision support for schedule modification after the computation off-line of a predictive optimal (or near optimal) schedule. The purpose of this work i...
Mohamed Ali Aloulou, Christian Artigues
APN
2005
Springer
15 years 3 months ago
Can I Execute My Scenario in Your Net?
This paper describes the verification module (the VipVerify Module) of the VipTool [4]. VipVerify allows to verify whether a given scenario is an execution of a system model, give...
Gabriel Juhás, Robert Lorenz, Jörg Des...
ARITH
2003
IEEE
15 years 3 months ago
High-Performance Left-to-Right Array Multiplier Design
We propose a split array multiplier organized in a left-to-right leapfrog (LRLF) structure with reduced delay compared to conventional array multipliers. Moreover, the proposed de...
Zhijun Huang, Milos D. Ercegovac
LCN
1999
IEEE
15 years 2 months ago
The New Shortest Best Path Tree (SBPT) Algorithm for Dynamic Multicast Trees
This paper presents the new Shortest Best Path Tree (SBPT) algorithm for multicast trees. The SBPT algorithm establishes and maintains dynamic multicast trees which maximize the b...
Hiroshi Fujinoki, Kenneth J. Christensen