Sciweavers

3307 search results - page 437 / 662
» The meaning of concurrent programs
Sort
View
ENDM
2010
101views more  ENDM 2010»
15 years 7 months ago
Strong Lower Bounds for a Survivable Network Design Problem
We consider a generalization of the Prize Collecting Steiner Tree Problem on a graph with special redundancy requirements on a subset of the customer nodes suitable to model a rea...
Markus Leitner, Günther R. Raidl
JUCS
2008
117views more  JUCS 2008»
15 years 7 months ago
Disentangling Denotational Semantics Definitions
Abstract: Denotational semantics is a powerful technique to formally define programming languages. However, language constructs are not always orthogonal, so many semantic equation...
Fabio Tirelo, Roberto da Silva Bigonha, Joã...
PC
2006
96views Management» more  PC 2006»
15 years 7 months ago
Modeling Master/Worker applications for automatic performance tuning
Parallel application development is a very difficult task for non-expert programmers, and therefore support tools are needed for all phases of this kind of application development...
Eduardo César, Andreu Moreno, Joan Sorribes...
SCL
2008
86views more  SCL 2008»
15 years 7 months ago
Control design in the time and frequency domain using nonsmooth techniques
Significant progress in control design has been achieved by the use of nonsmooth and semiinfinite mathematical programming techniques. In contrast with LMI or BMI approaches, thes...
Vincent Bompart, Pierre Apkarian, Dominikus Noll
CORR
2002
Springer
87views Education» more  CORR 2002»
15 years 7 months ago
Ultimate approximations in nonmonotonic knowledge representation systems
We study xpoints of operators on lattices. To this end we introduce the notion of an approximation of an operator. We order approximations by means of a precision ordering. We sho...
Marc Denecker, V. Wiktor Marek, Miroslaw Truszczyn...