Sciweavers

11160 search results - page 384 / 2232
» Incompleteness in a General Setting
Sort
View
AML
2008
66views more  AML 2008»
15 years 7 months ago
Register computations on ordinals
We generalize ordinary register machines on natural numbers to machines whose registers contain arbitrary ordinals. Ordinal register machines are able to compute a recursive bounde...
Peter Koepke, Ryan Siders
CODES
1999
IEEE
15 years 11 months ago
An ASIP design methodology for embedded systems
A well-known challenge during processor design is to obtain the best possible results for a typical target application domain that is generally described as a set of benchmarks. O...
Kayhan Küçükçakar
CROSSROADS
2008
86views more  CROSSROADS 2008»
15 years 7 months ago
The use of compiler optimizations for embedded systems software
O ptimizing embedded applications using a compiler can generally be broken down into two major categories: hand-optimizing code to take advantage of a particular processor's ...
Joe Bungo
TOOLS
2010
IEEE
15 years 5 months ago
Understanding the Impact of Collection Contracts on Design
Abstract. Java provides a specification for a user-defined general purpose equivalence operator for objects, but collections such as Set have more stringent requirements. This in...
Stephen Nelson, David J. Pearce, James Noble
ICPR
2004
IEEE
16 years 8 months ago
Adjustable Invariant Features by Partial Haar-Integration
A very common type of a-priori knowledge in pattern analysis problems is invariance of the input data with respect to transformation groups, e.g. geometric transformations of imag...
Alaa Halawani, Bernard Haasdonk, Hans Burkhardt