Sciweavers

2244 search results - page 394 / 449
» A new heuristic approach for non-convex optimization problem...
Sort
View
WEA
2005
Springer
98views Algorithms» more  WEA 2005»
15 years 5 months ago
Implementing Minimum Cycle Basis Algorithms
Abstract. In this paper we consider the problem of computing a minimum cycle basis of an undirected graph G = (V, E) with n vertices and m edges. We describe an efficient implement...
Kurt Mehlhorn, Dimitrios Michail
SAC
2003
ACM
15 years 5 months ago
A Markov Random Field Model of Microarray Gridding
DNA microarray hybridisation is a popular high throughput technique in academic as well as industrial functional genomics research. In this paper we present a new approach to auto...
Mathias Katzer, Franz Kummert, Gerhard Sagerer
CN
2007
91views more  CN 2007»
14 years 12 months ago
On investigating overlay service topologies
Recently, a moderate amount of work has been reported on the use of overlay networks to support value-added network services, such as multicasting, Quality of Service (QoS), secur...
Zhi Li, Prasant Mohapatra
JAIR
2006
157views more  JAIR 2006»
14 years 11 months ago
Decision-Theoretic Planning with non-Markovian Rewards
A decision process in which rewards depend on history rather than merely on the current state is called a decision process with non-Markovian rewards (NMRDP). In decisiontheoretic...
Sylvie Thiébaux, Charles Gretton, John K. S...
VLDB
2002
ACM
143views Database» more  VLDB 2002»
14 years 11 months ago
SQL Memory Management in Oracle9i
Complex database queries require the use of memory-intensive operators like sort and hashjoin. Those operators need memory, also referred to as SQL memory, to process their input ...
Benoît Dageville, Mohamed Zaït