Sciweavers

8196 search results - page 381 / 1640
» Computational Modeling and Complexity Science
Sort
View
FOCS
2009
IEEE
16 years 1 months ago
Distance Oracles for Sparse Graphs
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
Christian Sommer 0002, Elad Verbin, Wei Yu
ACSC
2005
IEEE
16 years 11 days ago
A Two-Pronged Attack on the Dragon of Intractability
One approach to tractably finding a solution to an NP-complete optimisation problem is heuristic, where the solution is inexact but quickly found; another approach is to reduce t...
Stephen Gilmour, Mark Dras
TSP
2010
15 years 1 months ago
Selection policy-induced reduction mappings for Boolean networks
Developing computational models paves the way to understanding, predicting, and influencing the long-term behavior of genomic regulatory systems. However, several major challenges ...
Ivan Ivanov, Plamen Simeonov, Noushin Ghaffari, Xi...
CSI
2007
89views more  CSI 2007»
15 years 6 months ago
Writing and executing ODP computational viewpoint specifications using Maude
The Reference Model of Open Distributed Processing (RM-ODP) is a joint standardization effort by ITU-T and ISO/IEC for the specification of large open distributed systems. RM-ODP ...
José Raúl Romero, Antonio Vallecillo...
BIB
2007
139views more  BIB 2007»
15 years 6 months ago
Petri net modelling of biological networks
Mathematical modelling is increasingly used to get insights into the functioning of complex biological networks. In this context, Petri nets (PNs) have recently emerged as a promi...
Claudine Chaouiya