Sciweavers

873 search results - page 174 / 175
» step 2005
Sort
View
JSS
2007
115views more  JSS 2007»
13 years 9 months ago
A case study in re-engineering to enforce architectural control flow and data sharing
Without rigorous software development and maintenance, software tends to lose its original architectural structure and become difficult to understand and modify. ArchJava, a recen...
Marwan Abi-Antoun, Jonathan Aldrich, Wesley Coelho
JCT
2010
83views more  JCT 2010»
13 years 8 months ago
Families of prudent self-avoiding walks
A self-avoiding walk (SAW) on the square lattice is prudent if it never takes a step towards a vertex it has already visited. Prudent walks differ from most classes of SAW that ha...
Mireille Bousquet-Mélou
STACS
2010
Springer
14 years 4 months ago
Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs
In 2000 Alber et al. [SWAT 2000 ] obtained the first parameterized subexponential algorithm on undirected planar graphs by showing that k-DOMINATING SET is solvable in time 2O( ...
Frederic Dorn, Fedor V. Fomin, Daniel Lokshtanov, ...
ICSE
2007
IEEE-ACM
14 years 3 months ago
ACL2s: "The ACL2 Sedan"
ACL2 is the latest inception of the Boyer-Moore theorem prover, the 2005 recipient of the ACM Software System Award. In the hands of an expert, it feels like a finely tuned race ...
Peter C. Dillinger, Panagiotis Manolios, Daron Vro...
FOCS
2005
IEEE
14 years 3 months ago
Lower Bounds for the Noisy Broadcast Problem
We prove the first non-trivial (super linear) lower bound in the noisy broadcast model, defined by El Gamal in [6]. In this model there are n + 1 processors P0, P1, . . . , Pn, ...
Navin Goyal, Guy Kindler, Michael E. Saks