Sciweavers

4781 search results - page 155 / 957
» Complexity at large
Sort
View
NFM
2011
264views Formal Methods» more  NFM 2011»
13 years 5 months ago
Applying Atomicity and Model Decomposition to a Space Craft System in Event-B
Abstract. Event-B is a formal method for modeling and verifying consistency of systems. In formal methods such as Event-B, refinement is the process of enriching or modifying an a...
Asieh Salehi Fathabadi, Abdolbaghi Rezazadeh, Mich...
CORR
2010
Springer
62views Education» more  CORR 2010»
13 years 7 months ago
A semantic approach for the requirement-driven discovery of web services in the Life Sciences
Research in the Life Sciences depends on the integration of large, distributed and heterogeneous data sources and web services. The discovery of which of these resources are the mo...
María Pérez, Rafael Berlanga Llavori...
CGI
1998
IEEE
14 years 2 months ago
Hierarchical Visibility Culling with Occlusion Trees
In the scope of rendering complex models with high depth complexity, it is of great importance to design outputsensitive algorithms, i.e., algorithms with the time complexity prop...
Jirí Bittner, Vlastimil Havran, Pavel Slav&...
SCP
2010
189views more  SCP 2010»
13 years 5 months ago
Distributed and Collaborative Software Evolution Analysis with Churrasco
Analyzing the evolution of large and long-lived software systems is a complex problem that requires extensive tool support due to the amount and complexity of the data that needs ...
Marco D'Ambros, Michele Lanza
APAL
2006
94views more  APAL 2006»
13 years 10 months ago
Parameterized counting problems
Parameterized complexity has, so far, been largely con ned to consideration of computational problems as decision or search problems. However, it is becoming evident that the param...
Catherine McCartin