Sciweavers

8413 search results - page 37 / 1683
» Ordering Problem Subgoals
Sort
View
TSE
2011
111views more  TSE 2011»
13 years 2 months ago
Software Module Clustering as a Multi-Objective Search Problem
Software module clustering is the problem of automatically organising software units into modules to improve program structure. There has been a great deal of recent interest in s...
Kata Praditwong, Mark Harman, Xin Yao
SIAMNUM
2010
127views more  SIAMNUM 2010»
13 years 2 months ago
The Discrete Duality Finite Volume Method for Convection-diffusion Problems
In this paper we extend the discrete duality finite volume (DDFV) formulation to the steady convection-diffusion equation. The discrete gradients defined in DDFV are used to define...
Yves Coudière, Gianmarco Manzini
ASWC
2009
Springer
13 years 11 months ago
Reasoning about Partially Ordered Web Service Activities in PSL
Many tasks within semantic web service discovery can be formalized as reasoning problems related to the partial ordering of subactivity occurrences in a complex activity. We show h...
Michael Gruninger, Xing Tan
ASPDAC
2008
ACM
93views Hardware» more  ASPDAC 2008»
13 years 10 months ago
Ordered escape routing based on Boolean satisfiability
Abstract-- Routing for high-speed boards is largely a timeconsuming manual task today. In this work we consider the ordered escape routing problem which is a key problem in boardle...
Lijuan Luo, Martin D. F. Wong
JCO
2008
84views more  JCO 2008»
13 years 8 months ago
Partitioning a weighted partial order
The problem of partitioning a partially ordered set into a minimum number of chains is a well-known problem. In this paper we study a generalization of this problem, where we not ...
Linda S. Moonen, Frits C. R. Spieksma