Sciweavers

4401 search results - page 583 / 881
» Computing with Default Logic
Sort
View
RTA
2010
Springer
15 years 10 months ago
A Proof Calculus Which Reduces Syntactic Bureaucracy
In usual proof systems, like the sequent calculus, only a very limited way of combining proofs is available through the tree structure. We present in this paper a logicindependent ...
Alessio Guglielmi, Tom Gundersen, Michel Parigot
ICCTA
2007
IEEE
15 years 10 months ago
Faster Placer for Island-Style FPGAs
In this paper, we propose a placement method for islandstyle FPGAs, based on fast yet very good initial placement followed by refinement using ultra-low temperature Simulated Anne...
Pritha Banerjee, Susmita Sur-Kolay
ICDCS
2007
IEEE
15 years 10 months ago
Build One, Get One Free: Leveraging the Coexistence of Multiple P2P Overlay Networks
Many different P2P overlay networks providing various functionalities, targeting specific applications, have been proposed in the past five years. It is now reasonable to consider...
Balasubramaneyam Maniymaran, Marin Bertier, Anne-M...
ACMSE
2006
ACM
15 years 10 months ago
Yaccscript: a platform for intersecting high-level languages
Programming paradigms are often skewed towards a particular domain of problems, thus one effective way to utilize them is through a multiparadigm approach to software development....
John Healey
CIE
2006
Springer
15 years 10 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