Sciweavers

2272 search results - page 327 / 455
» Capture Complexity by Partition
Sort
View
TACAS
2007
Springer
116views Algorithms» more  TACAS 2007»
16 years 14 days ago
Model Checking on Trees with Path Equivalences
For specifying and verifying branching-time requirements, a reactive system is traditionally modeled as a labeled tree, where a path in the tree encodes a possible execution of the...
Rajeev Alur, Pavol Cerný, Swarat Chaudhuri
VLSI
2007
Springer
16 years 13 days ago
Parametric structure-preserving model order reduction
Abstract—Analysis and verification environments for nextgeneration nano-scale RFIC designs must be able to cope with increasing design complexity and to account for new effects,...
Jorge Fernandez Villena, Wil H. A. Schilders, L. M...
WINE
2007
Springer
132views Economy» more  WINE 2007»
16 years 13 days ago
Adwords Auctions with Decreasing Valuation Bids
The choice of a bidding language is crucial in auction design in order to correctly capture bidder utilities. We propose a new bidding model for the Adwords auctions of search eng...
Gagan Goel, Aranyak Mehta
ACSC
2006
IEEE
16 years 12 days ago
Interaction design for a mobile context-aware system using discrete event modelling
This paper describes our experience when applying formal methods in the design of the tourist information system TIP, which presents context-sensitive information to mobile users ...
Annika Hinze, Petra Malik, Robi Malik
AINA
2006
IEEE
16 years 12 days ago
Autonomic Trust Prediction for Pervasive Systems
Pervasive computing is becoming a reality, thanks to advances in wireless networking and increased popularity of portable devices. Users of these devices will need support to deci...
Licia Capra, Mirco Musolesi