Sciweavers

9370 search results - page 1574 / 1874
» An Abstract Notion of Application
Sort
View
AISC
2008
Springer
15 years 8 months ago
Case Studies in Model Manipulation for Scientific Computing
Abstract. The same methodology is used to develop 3 different applications. We begin by using a very expressive, appropriate Domain Specific Language, to write down precise problem...
Jacques Carette, Spencer Smith, John McCutchan, Ch...
ANTSW
2008
Springer
15 years 8 months ago
A Simulation Study of Routing Performance in Realistic Urban Scenarios for MANETs
Abstract. We study through simulation the performance of two MANET routing algorithms in a realistic urban environment. The two algorithms, AODV and AntHocNet, are representative o...
Gianni Di Caro, Frederick Ducatelle, Luca Maria Ga...
AOSE
2008
Springer
15 years 8 months ago
A Unified Graphical Notation for AOSE
Abstract. Over the last five years a number of agent system development methodologies have been proposed and developed, with a number of them becoming well established and used bey...
Lin Padgham, Michael Winikoff, Scott A. DeLoach, M...
APLAS
2008
ACM
15 years 8 months ago
Context-Sensitive Relevancy Analysis for Efficient Symbolic Execution
Abstract. Symbolic execution is a flexible and powerful, but computationally expensive technique to detect dynamic behaviors of a program. In this paper, we present a context-sensi...
Xin Li, Daryl Shannon, Indradeep Ghosh, Mizuhito O...
APPROX
2008
Springer
245views Algorithms» more  APPROX 2008»
15 years 8 months ago
Approximating Optimal Binary Decision Trees
Abstract. We give a (ln n + 1)-approximation for the decision tree (DT) problem. An instance of DT is a set of m binary tests T = (T1, . . . , Tm) and a set of n items X = (X1, . ....
Micah Adler, Brent Heeringa
« Prev « First page 1574 / 1874 Last » Next »