Sciweavers

9842 search results - page 324 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
JVA
2006
IEEE
15 years 10 months ago
Simulated Annealing for Grid Scheduling Problem
Grid computing is a form of distributed computing that involves coordinating and sharing computing, application, data storage or network resources across dynamic and geographicall...
Stefka Fidanova
151
Voted
PARA
2004
Springer
15 years 9 months ago
A Domain Theoretic Account of Euler's Method for Solving Initial Value Problems
Abstract. This paper presents a method of solving initial value problems using Euler’s method, based on the domain of interval valued functions of a real variable. In contrast to...
Abbas Edalat, Dirk Pattinson
ESA
2003
Springer
124views Algorithms» more  ESA 2003»
15 years 9 months ago
The Minimum Generalized Vertex Cover Problem
Let G = (V, E) be an undirected graph, with three numbers d0(e) ≥ d1(e) ≥ d2(e) ≥ 0 for each edge e ∈ E. A solution is a subset U ⊆ V and di(e) represents the cost contr...
Refael Hassin, Asaf Levin
INFOVIS
2000
IEEE
15 years 8 months ago
Interactive Problem Solving via Algorithm Visualization
COMIND is a tool for conceptual design of industrial products. It helps designers define and evaluate the initial design space by using search algorithms to generate sets of feasi...
Pearl Pu, Denis Lalanne
225
Voted
SIGMOD
2006
ACM
123views Database» more  SIGMOD 2006»
16 years 4 months ago
Proactive identification of performance problems
We propose to demonstrate Fa, an automated tool for timely and accurate prediction of Service-Level-Agreement (SLA) violations caused by performance problems in database systems. ...
Songyun Duan, Shivnath Babu