Sciweavers

5473 search results - page 756 / 1095
» On the graph isomorphism problem
Sort
View
186
Voted
WADS
2001
Springer
86views Algorithms» more  WADS 2001»
15 years 11 months ago
Practical Approximation Algorithms for Separable Packing Linear Programs
Abstract. We describe fully polynomial time approximation schemes for generalized multicommodity flow problems arising in VLSI applications such as Global Routing via Buffer Block...
Feodor F. Dragan, Andrew B. Kahng, Ion I. Mandoiu,...
DCOSS
2008
Springer
15 years 8 months ago
Energy-Efficient Task Mapping for Data-Driven Sensor Network Macroprogramming
Data-driven macroprogramming of wireless sensor networks (WSNs) provides an easy to use high-level task graph representation to the application developer. However, determining an e...
Animesh Pathak, Viktor K. Prasanna
EWCBR
2008
Springer
15 years 8 months ago
iReMedI- Intelligent Retrieval from Medical Information
Abstract. Effective encoding of information is one of the keys to qualitative problem solving. Our aim is to explore Knowledge representation techniques that capture meaningful wor...
Saurav Sahay, Bharat Ravisekar, Sundaresan Venkata...
AAAI
2010
15 years 8 months ago
Dealing with Infinite Loops, Underestimation, and Overestimation of Depth-First Proof-Number Search
Depth-first proof-number search (df-pn) is powerful AND/OR tree search to solve positions in games. However, df-pn has a notorious problem of infinite loops when applied to domain...
Akihiro Kishimoto
FLAIRS
2004
15 years 8 months ago
A New Approach for Heterogeneous Hybridization of Constraint Satisfaction Search Algorithms
In the recent years, CSP's have come to be seen as the core problem in many applications. We propose here a hybrid algorithm (MC-FC) that combines two different search method...
Debasis Mitra, Hyoung-rae Kim