Sciweavers

2523 search results - page 125 / 505
» Objective: In Minimum Context
Sort
View
STOC
1995
ACM
145views Algorithms» more  STOC 1995»
15 years 7 months ago
Polynomial time approximation schemes for dense instances of NP-hard problems
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...
Sanjeev Arora, David R. Karger, Marek Karpinski
133
Voted
TCS
2008
15 years 4 months ago
Approximation algorithms for partially covering with edges
The edge dominating set (EDS) and edge cover (EC) problems are classical graph covering problems in which one seeks a minimum cost collection of edges which covers the edges or ve...
Ojas Parekh
118
Voted
ECSCW
1997
15 years 5 months ago
Tailoring Cooperation Support through Mediators
: Cooperative processes are strongly influenced by their context. Individual and group experience, work practices, and the organisational setting are variable factors that help sha...
Anja Syri
ECAI
2000
Springer
15 years 8 months ago
An Ontology Enrichment Method for a Pragmatic Information Extraction System gathering Data on Genetic Interactions
We present in this paper a method to insert new concepts in an existing information extraction system based on a conceptual graph architecture. We use verb patterns as conceptual s...
Claude Roux, Denys Proux, François Rechenma...
ISMIS
2009
Springer
15 years 10 months ago
GIS-FLSolution: A Spatial Analysis Platform for Static and Transportation Facility Location Allocation Problem
Static and transportation facility location allocation problem is a new problem in facility location research. It aims to find out optimal locations of static and transportation fa...
Wei Gu, Xin Wang, Liqiang Geng