Sciweavers

8828 search results - page 1232 / 1766
» Formal methods in practice
Sort
View
EOR
2010
93views more  EOR 2010»
15 years 7 months ago
Two-stage flexible-choice problems under uncertainty
A significant input-data uncertainty is often present in practical situations. One approach to coping with this uncertainty is to describe the uncertainty with scenarios. A scenar...
Jurij Mihelic, Amine Mahjoub, Christophe Rapine, B...
ASE
2006
110views more  ASE 2006»
15 years 7 months ago
Runtime recovery and manipulation of software architecture of component-based systems
Recently, more attention is paid to the researches and practices on how to use software architecture in software maintenance and evolution to reduce their complexity and cost. The ...
Gang Huang, Hong Mei, Fuqing Yang
COMCOM
2006
121views more  COMCOM 2006»
15 years 7 months ago
Interactive Transparent Networking: Protocol meta modeling based on EFSM
the extensibility and evolution of network services and protocols had become a major research issue in recent years. The 'programmable' and 'active' network par...
Javed I. Khan, Raid Zaghal
IWC
2008
99views more  IWC 2008»
15 years 7 months ago
Pedagogy and usability in interactive algorithm visualizations: Designing and evaluating CIspace
Interactive algorithm visualizations (AVs) are powerful tools for teaching and learning concepts that are difficult to describe with static media alone. However, while countless A...
Saleema Amershi, Giuseppe Carenini, Cristina Conat...
JSAC
2006
157views more  JSAC 2006»
15 years 7 months ago
Traffic grooming in path, star, and tree networks: complexity, bounds, and algorithms
We consider the problem of traffic grooming in WDM path, star, and tree networks. Traffic grooming is a variant of the well-known logical topology design, and is concerned with the...
Shu Huang, Rudra Dutta, George N. Rouskas
« Prev « First page 1232 / 1766 Last » Next »