Sciweavers

375 search results - page 58 / 75
» Making Abstract Machines Less Abstract
Sort
View
WAOA
2010
Springer
256views Algorithms» more  WAOA 2010»
14 years 8 months ago
The Train Delivery Problem - Vehicle Routing Meets Bin Packing
Abstract. We consider the train delivery problem which is a generalization of the bin packing problem and is equivalent to a one dimensional version of the vehicle routing problem ...
Aparna Das, Claire Mathieu, Shay Mozes
SIGSOFT
2008
ACM
15 years 11 months ago
Finding programming errors earlier by evaluating runtime monitors ahead-of-time
Runtime monitoring allows programmers to validate, for instance, the proper use of application interfaces. Given a property specification, a runtime monitor tracks appropriate run...
Eric Bodden, Patrick Lam, Laurie J. Hendren
APPROX
2007
Springer
112views Algorithms» more  APPROX 2007»
15 years 4 months ago
Encouraging Cooperation in Sharing Supermodular Costs
Abstract Consider a situation where a group of agents wishes to share the costs of their joint actions, and needs to determine how to distribute the costs amongst themselves in a f...
Andreas S. Schulz, Nelson A. Uhan
WISTP
2007
Springer
15 years 4 months ago
Mobile Phones as Secure Gateways for Message-Based Ubiquitous Communication
Abstract. For ubiquitous communication self-organising adhoc networks become more and more important. We consider mobile phones as appropriate secure gateways to provide access to ...
Walter Bamberger, Oliver Welter, Stephan Spitz
UML
2005
Springer
15 years 3 months ago
Specifying Precise Use Cases with Use Case Charts
Use cases are a popular method for capturing and structuring software requirements. The informality of use cases is both a blessing and a curse. It enables easy application and lea...
Jon Whittle