Sciweavers

67 search results - page 11 / 14
» The Complexity of Embedding Orders into Small Products of Ch...
Sort
View
COCO
2011
Springer
216views Algorithms» more  COCO 2011»
12 years 7 months ago
Linear Systems over Finite Abelian Groups
We consider a system of linear constraints over any finite Abelian group G of the following form: i(x1, . . . , xn) ≡ i,1x1 + · · · + i,nxn ∈ Ai for i = 1, . . . , t and e...
Arkadev Chattopadhyay, Shachar Lovett
ICLP
2005
Springer
14 years 1 months ago
Techniques for Scaling Up Analyses Based on Pre-interpretations
Any finite tree automaton (or regular type) can be used to construct act interpretation of a logic program, by first determinising and completing the automaton to get a pre-inter...
John P. Gallagher, Kim S. Henriksen, Gourinath Ban...
ICSEA
2006
IEEE
14 years 1 months ago
Enforcing Interaction Properties in AOSD-Enabled Systems
The construction and maintenance of large and complex software systems depend on the existence of global principles describing the structure and the interaction among its various ...
Constantin Serban, Shmuel S. Tyszberowicz
SIGMOD
2004
ACM
154views Database» more  SIGMOD 2004»
14 years 7 months ago
Compressing Historical Information in Sensor Networks
We are inevitably moving into a realm where small and inexpensive wireless devices would be seamlessly embedded in the physical world and form a wireless sensor network in order t...
Antonios Deligiannakis, Yannis Kotidis, Nick Rouss...
IJET
2007
121views more  IJET 2007»
13 years 7 months ago
A Technology Based Program That Matches Enrichment Resources With Student Strengths
Remarkable advances in instructional communication technology (ICT) have now made is possible to provide high levels of enrichment and the kinds of curricular differentiation that...
Joseph S. Renzulli, Sally M. Reis