Sciweavers

4940 search results - page 840 / 988
» On the Complexity of Universal Programs
Sort
View
RTSS
1999
IEEE
15 years 10 months ago
Timing Anomalies in Dynamically Scheduled Microprocessors
Previous timing analysis methods have assumed that the worst-case instruction execution time necessarily corresponds to the worst-case behavior. We show that this assumption is wr...
Thomas Lundqvist, Per Stenström
DEXAW
1998
IEEE
155views Database» more  DEXAW 1998»
15 years 10 months ago
Business-Oriented Component-Based Software Development and Evolution
Huge size and high complexity of legacy software are the main sources of today's software evolution problems. While we can ease software evolution with re-engineering tools, ...
Stan Jarzabek, Martin Hitz
IEAAIE
1999
Springer
15 years 10 months ago
Modelling Fuzzy Sets Using Object-Oriented Techniques
This paper describes a new approach to model fuzzy sets using object-oriented programming techniques. Currently, the most frequently used method to model fuzzy sets is by using a p...
Gary Yat Chung Wong, Hon Wai Chun
ROBOCUP
1999
Springer
95views Robotics» more  ROBOCUP 1999»
15 years 10 months ago
Spatial Agents Implemented in a Logical Expressible Language
In this paper, we present a multi-layered architecture for spatial and temporal agents. The focus is laid on the declarativity of the approach, which makes agent scripts expressive...
Frieder Stolzenburg, Oliver Obst, Jan Murray, Bj&o...
IPPS
1998
IEEE
15 years 10 months ago
Low Memory Cost Dynamic Scheduling of Large Coarse Grain Task Graphs
Schedulinglarge task graphsis an importantissue in parallel computingsince it allowsthe treatment of big size problems. In this paper we tackle the following problem: how to sched...
Michel Cosnard, Emmanuel Jeannot, Laurence Rougeot