Sciweavers

933 search results - page 120 / 187
» Extending Forward Checking
Sort
View
LICS
2010
IEEE
15 years 4 months ago
The Emptiness Problem for Tree Automata with Global Constraints
We define tree automata with global constraints (TAGC), generalizing the well-known class of tree automata with global equality and disequality constraints [14] (TAGED). TAGC can...
Luis Barguñó, Carles Creus, Guillem ...
APSEC
2009
IEEE
15 years 3 months ago
A Formal Framework to Integrate Timed Security Rules within a TEFSM-Based System Specification
Abstract--Formal methods are very useful in software industry and are becoming of paramount importance in practical engineering techniques. They involve the design and the modeling...
Wissam Mallouli, Amel Mammar, Ana R. Cavalli
JAIR
2011
103views more  JAIR 2011»
15 years 1 months ago
Automated Search for Impossibility Theorems in Social Choice Theory: Ranking Sets of Objects
We present a method for using standard techniques from satisfiability checking to automatically verify and discover theorems in an area of economic theory known as ranking sets o...
C. Geist, Ulrich Endriss
MICRO
2008
IEEE
124views Hardware» more  MICRO 2008»
16 years 13 days ago
Token tenure: PATCHing token counting using directory-based cache coherence
Traditional coherence protocols present a set of difficult tradeoffs: the reliance of snoopy protocols on broadcast and ordered interconnects limits their scalability, while dire...
Arun Raghavan, Colin Blundell, Milo M. K. Martin
MOBICOM
2006
ACM
16 years 14 hour ago
Low-cost communication for rural internet kiosks using mechanical backhaul
Rural kiosks in developing countries provide a variety of services such as birth, marriage, and death certificates, electricity bill collection, land records, email services, and...
Aaditeshwar Seth, D. Kroeker, Matei A. Zaharia, Sh...