Sciweavers

828 search results - page 93 / 166
» Bounded Hairpin Completion
Sort
View
ECAI
2006
Springer
14 years 1 months ago
Modal Logics for Communicating Rule-Based Agents
In this paper, we show how to establish correctness and time bounds (e.g., quality of service guarantees) for multi-agent systems composed of communicating rule-based agents. The f...
Natasha Alechina, Mark Jago, Brian Logan
ESA
2006
Springer
82views Algorithms» more  ESA 2006»
14 years 1 months ago
Preemptive Online Scheduling: Optimal Algorithms for All Speeds
Our main result is an optimal online algorithm for preemptive scheduling on uniformly related machines with the objective to minimize makespan. The algorithm is deterministic, yet...
Tomás Ebenlendr, Wojciech Jawor, Jiri Sgall
GOSLER
1995
14 years 1 months ago
Learning and Consistency
In designing learning algorithms it seems quite reasonable to construct them in such a way that all data the algorithm already has obtained are correctly and completely reflected...
Rolf Wiehagen, Thomas Zeugmann
COMPGEOM
2005
ACM
14 years 2 hour ago
Abstract order type extension and new results on the rectilinear crossing number
Order Type Extension and New Results ectilinear Crossing Number - Extended Abstract Oswin Aichholzer∗ Hannes Krasser† We provide a complete data base of all realizable order t...
Oswin Aichholzer, Hannes Krasser
ASAP
2007
IEEE
116views Hardware» more  ASAP 2007»
13 years 12 months ago
The Design of a Novel Object-oriented Processor : OOMIPS
A novel object-oriented processor is proposed in this paper, which provides support for object addressing, message passing and dynamic memory management. Object running on this pr...
Weixing Ji, Feng Shi, Baojun Qiao, Muhammad Kamran