Sciweavers

362 search results - page 58 / 73
» Finding Motifs with Gaps
Sort
View
APPROX
2008
Springer
127views Algorithms» more  APPROX 2008»
13 years 9 months ago
Approximating Single Machine Scheduling with Scenarios
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...
Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svenss...
ECOWS
2006
Springer
13 years 9 months ago
Parallel Web Service Composition in MoSCoE: A Choreography-Based Approach
We present a goal-driven approach to model a choreographer for realizing composite Web services. In this framework, the users start with an abstract, and possibly incomplete funct...
Jyotishman Pathak, Samik Basu, Robyn R. Lutz, Vasa...
CATS
2008
13 years 9 months ago
Graph Classes and the Complexity of the Graph Orientation Minimizing the Maximum Weighted Outdegree
Given an undirected graph with edge weights, we are asked to find an orientation, i.e., an assignment of a direction to each edge, so as to minimize the weighted maximum outdegree...
Yuichi Asahiro, Eiji Miyano, Hirotaka Ono
ECIS
2004
13 years 9 months ago
Inserting ICT and IS in a complex organisational environment using an organisational learning model
Within the last few years, knowledge management has become one of the hottest subjects among organisational and information systems theorists and practitioners. Many find in it an...
Silvina Santana
DATESO
2006
106views Database» more  DATESO 2006»
13 years 9 months ago
GeKon - Applying Novel Approaches to GIS Development
Abstract. This paper describes a few ideas concerned with geographical information systems (GIS) development. Those ideas come from a GIS development project named GeKon, which is ...
Tomas Richta