Sciweavers

141 search results - page 9 / 29
» Bounding basis reduction properties
Sort
View
CP
2006
Springer
14 years 1 months ago
Global Optimization of Probabilistically Constrained Linear Programs
We consider probabilistic constrained linear programs with general distributions for the uncertain parameters. These problems generally involve non-convex feasible sets. We develo...
Shabbir Ahmed
DATESO
2008
129views Database» more  DATESO 2008»
13 years 11 months ago
Database Engineering from the Category Theory Viewpoint
Abstract. This paper gives an overview of XML formal models, summarizes database engineering practices, problems and their evolution. We focus on categorical aspects of XML formal ...
David Toth
ISSTA
1996
ACM
14 years 1 months ago
Elements of Style: Analyzing a Software Design Feature with a Counterexample Detector
We illustrate the application of Nitpick, a specification checker, to the design of a style mechanism for a word processor. The design is cast, along with some expected properties...
Daniel Jackson, Craig Damon
POPL
2009
ACM
14 years 10 months ago
Verifying liveness for asynchronous programs
Asynchronous or "event-driven" programming is a popular technique to efficiently and flexibly manage concurrent interactions. In these programs, the programmer can post ...
Pierre Ganty, Rupak Majumdar, Andrey Rybalchenko
GLOBECOM
2008
IEEE
14 years 4 months ago
Routing with Probabilistic Delay Guarantees in Wireless Ad-Hoc Networks
—In many wireless ad-hoc networks it is important to find a route that delivers a message to the destination within a certain deadline (delay constraint). We propose to identify...
Matthew Brand, Petar Maymounkov, Andreas F. Molisc...