Sciweavers

694 search results - page 123 / 139
» Open Graphs and Computational Reasoning
Sort
View
CAISE
2004
Springer
14 years 23 days ago
Simple and Minimum-Cost Satisfiability for Goal Models
Abstract. Goal models have been used in Computer Science in order to represent software requirements, business objectives and design qualities. In previous work we have presented a...
Roberto Sebastiani, Paolo Giorgini, John Mylopoulo...
ACL
1993
13 years 10 months ago
Parsing Free Word Order Languages in the Paninian Framework
There is a need to develop a suitable computational grammar formalism for free word order languages for two reasons: First, a suitably designed formalism is likely to be more effi...
Akshar Bharati, Rajeev Sangal
BMCBI
2007
144views more  BMCBI 2007»
13 years 9 months ago
Gene analogue finder: a GRID solution for finding functionally analogous gene products
Background: To date more than 2,1 million gene products from more than 100000 different species have been described specifying their function, the processes they are involved in a...
Angelica Tulipano, Giacinto Donvito, Flavio Licciu...
PADS
2005
ACM
14 years 2 months ago
Simulating Realistic Packet Routing without Routing Protocols
A fundamental requirement for any network simulation environment is the realistic forwarding of packets from a source to a destination in the simulated topology. The routing decis...
George F. Riley, Dheeraj Reddy
BMCBI
2005
156views more  BMCBI 2005»
13 years 9 months ago
A new dynamical layout algorithm for complex biochemical reaction networks
Background: To study complex biochemical reaction networks in living cells researchers more and more rely on databases and computational methods. In order to facilitate computatio...
Katja Wegner, Ursula Kummer