Sciweavers

6598 search results - page 125 / 1320
» Graph Theory with Applications
Sort
View
ECIS
2003
15 years 6 months ago
A qualitative approach to investigating the behavioural definitions of the four-paradigm theory of information systems developme
Hirschheim, Klein and Lyytinen introduced the four-paradigm theory of information systems development (ISD) as a significant attempt to systematise developer assumptions. The theo...
Donal J. Flynn, Zahid I. Hussain
128
Voted
FROCOS
2007
Springer
15 years 10 months ago
Combining Proof-Producing Decision Procedures
Constraint solvers are key modules in many systems with reasoning capabilities (e.g., automated theorem provers). To incorporate constraint solvers in such systems, the capability ...
Silvio Ranise, Christophe Ringeissen, Duc-Khanh Tr...
141
Voted
SCAM
2006
IEEE
15 years 10 months ago
Constructing Accurate Application Call Graphs For Java To Model Library Callbacks
Call graphs are widely used to represent calling relationships among methods. However, there is not much interest in calling relationships among library methods in many software e...
Weilei Zhang, Barbara G. Ryder
WWW
2004
ACM
16 years 5 months ago
The webgraph framework I: compression techniques
Studying Web graphs is often difficult due to their large size. Recently, several proposals have been published about various techniques that allow to store a Web graph in memory ...
Paolo Boldi, Sebastiano Vigna
GECCO
2006
Springer
152views Optimization» more  GECCO 2006»
15 years 8 months ago
An agent-based algorithm for generalized graph colorings
This paper presents an algorithm for solving a number of generalized graph coloring problems. Specifically, it gives an agent-based algorithm for the Bandwidth Coloring problem. U...
Thang Nguyen Bui, ThanhVu H. Nguyen