Sciweavers

1837 search results - page 109 / 368
» Abstraction and the C Machine Model
Sort
View
TPDS
2010
109views more  TPDS 2010»
15 years 4 months ago
Minimal Sets of Turns for Breaking Cycles in Graphs Modeling Networks
Abstract—We propose an algorithm that provides for deadlockfree and livelock-free routing, in particular in wormhole routed networks. The proposed algorithm requires nearly minim...
Lev B. Levitin, Mark G. Karpovsky, Mehmet Mustafa
CADE
2008
Springer
16 years 6 months ago
Towards SMT Model Checking of Array-Based Systems
Abstract. We introduce the notion of array-based system as a suittraction of infinite state systems such as broadcast protocols or sorting programs. By using a class of quantified-...
Silvio Ghilardi, Enrica Nicolini, Silvio Ranise, D...
ICML
2009
IEEE
16 years 1 months ago
Decision tree and instance-based learning for label ranking
The label ranking problem consists of learning a model that maps instances to total orders over a finite set of predefined labels. This paper introduces new methods for label ra...
Weiwei Cheng, Jens C. Huhn, Eyke Hüllermeier
WECWIS
2008
IEEE
361views ECommerce» more  WECWIS 2008»
16 years 25 days ago
How to Describe Workflow Information Systems to Support Business Process
This paper addresses a methodology for developing the various user interfaces (UI) of a workflow information system (WIS), which are advocated to automate business processes, foll...
Josefina Guerrero García, Jean Vanderdonckt...
ESA
2003
Springer
93views Algorithms» more  ESA 2003»
15 years 11 months ago
Improved Bounds for Finger Search on a RAM
We present a new finger search tree with O(1) worst-case update time and O(log log d) expected search time with high probability in the Random Access Machine (RAM) model of comput...
Alexis C. Kaporis, Christos Makris, Spyros Sioutas...