10988 search results - page 551 / 2198 » Algorithmic Folding Complexity |
241
Voted
WINE
2005
Springer
16 years 27 days ago
2005
Springer
This paper studies the equilibrium property and algorithmic complexity of the exchange market equilibrium problem with concave piece-wise linear functions, which include linear an...
183
Voted
ASPDAC
2007
ACM
15 years 11 months ago
2007
ACM
- In general, fault dictionary is prevented from practical applications for its extremely large size. Several previous works are proposed for the fault dictionary size reduction. H...
196
click to vote
CIE
2006
Springer
15 years 11 months ago
2006
Springer
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...
209
Voted
FCS
2006
15 years 8 months ago
2006
- There is continuing research interest in comparison of the complexity of problems within the class NP-Complete. This paper examines the representational power of conjunctive norm...
175
Voted
TOG
2008
15 years 7 months ago
2008
We present a novel method for procedurally modeling large complex shapes. Our approach is general-purpose and takes as input any 3D polyhedral model provided by a user. The algori...