Sciweavers

153 search results - page 19 / 31
» Solving Demand Versions of Interprocedural Analysis Problems
Sort
View
ATAL
2005
Springer
14 years 1 months ago
Negotiation mechanism for TAC SCM component market
This paper presents a new negotiation mechanism and a new supplier model for Trading Agent Competition Supply Chain Management(TAC SCM). Under the new negotiation mechanism, an ag...
Dongmo Zhang
WINE
2005
Springer
98views Economy» more  WINE 2005»
14 years 29 days ago
A Framework on Compound Knowledge Push System Oriented to Organizational Employees
Organizational employees have different knowledge demands and the knowledge is compound. So how to push the right compound knowledge to the right organizational employees becomes i...
Zhi-Ping Fan, Yong Feng, Yong-Hong Sun, Bo Feng, T...
CIE
2006
Springer
13 years 11 months ago
On Graph Isomorphism for Restricted Graph Classes
Abstract. Graph isomorphism (GI) is one of the few remaining problems in NP whose complexity status couldn't be solved by classifying it as being either NP-complete or solvabl...
Johannes Köbler
TACAS
2004
Springer
108views Algorithms» more  TACAS 2004»
14 years 26 days ago
The Succinct Solver Suite
Abstract. The Succinct Solver Suite offers two analysis engines for solving data and control flow problems expressed in clausal form in a large fragment of first order logic. Th...
Flemming Nielson, Hanne Riis Nielson, Hongyan Sun,...
BMCBI
2011
12 years 11 months ago
A Novel And Well-Defined Benchmarking Method For Second Generation Read Mapping
Background: Second generation sequencing technologies yield DNA sequence data at ultra high-throughput. Common to most biological applications is a mapping of the reads to an almo...
Manuel Holtgrewe, Anne-Katrin Emde, David Weese, K...