Sciweavers

6740 search results - page 317 / 1348
» An s -Hamiltonian Line Graph Problem
Sort
View
156
Voted
CORR
2006
Springer
119views Education» more  CORR 2006»
15 years 4 months ago
Restricted Strip Covering and the Sensor Cover Problem
Suppose we are given a set of objects that cover a region and a duration associated with each object. Viewing the objects as jobs, can we schedule their beginning times to maximiz...
Adam L. Buchsbaum, Alon Efrat, Shaili Jain, Suresh...
IPCO
2001
184views Optimization» more  IPCO 2001»
15 years 5 months ago
Approximation Algorithms for the Minimum Bends Traveling Salesman Problem
Problem (Extended Abstract) Cliff Stein David P. Wagner Dartmouth College Computer Science Technical Report TR2000-367 May 9, 2000 The problem of traversing a set of points in the...
Clifford Stein, David P. Wagner
148
Voted
TOMS
1998
148views more  TOMS 1998»
15 years 3 months ago
PELLPACK: A Problem-Solving Environment for PDE-Based Applications on Multicomputer Platforms
This paper presents the software architecture and implementation of the problem solving environment (PSE) PELLPACK for modeling physical objects described by partial differential ...
Elias N. Houstis, John R. Rice, Sanjiva Weerawaran...
130
Voted
MP
2002
165views more  MP 2002»
15 years 3 months ago
A feasible semismooth asymptotically Newton method for mixed complementarity problems
Semismooth Newton methods constitute a major research area for solving mixed complementarity problems (MCPs). Early research on semismooth Newton methods is mainly on infeasible me...
Defeng Sun, Robert S. Womersley, Houduo Qi
DASFAA
2008
IEEE
188views Database» more  DASFAA 2008»
15 years 10 months ago
Summarization Graph Indexing: Beyond Frequent Structure-Based Approach
Graph is an important data structure to model complex structural data, such as chemical compounds, proteins, and XML documents. Among many graph data-based applications, sub-graph ...
Lei Zou, Lei Chen 0002, Huaming Zhang, Yansheng Lu...