Sciweavers

499 search results - page 78 / 100
» LTL satisfiability checking
Sort
View
CORR
2007
Springer
135views Education» more  CORR 2007»
14 years 9 months ago
On the decidability and complexity of Metric Temporal Logic over finite words
Abstract. Metric Temporal Logic (MTL) is a prominent specification formalism for realtime systems. In this paper, we show that the satisfiability problem for MTL over finite tim...
Joël Ouaknine, James Worrell
68
Voted
JCP
2006
129views more  JCP 2006»
14 years 9 months ago
Cancer Classification With MicroRNA Expression Patterns Found By An Information Theory Approach
Abstract-- Some non-coding small RNAs, known as microRNAs (miRNAs), have been shown to play important roles in gene regulation and various biological processes. The abnormal expres...
Yun Zheng, Chee Keong Kwoh
69
Voted
SYNTHESE
2008
114views more  SYNTHESE 2008»
14 years 9 months ago
Quantified coalition logic
We add a limited but useful form of quantification to Coalition Logic, a popular formalism for reasoning about cooperation in game-like multi-agent systems. The basic constructs o...
Thomas Ågotnes, Wiebe van der Hoek, Michael ...
89
Voted
IJSNET
2007
101views more  IJSNET 2007»
14 years 9 months ago
Some problems of directional sensor networks
Abstract: Wireless sensor networks are often based on omni-sensing and communication models. In contrast, in this paper, we investigate sensor networks with directional sensing and...
Huadong Ma, Yonghe Liu
78
Voted
TCS
2008
14 years 9 months ago
A unified approach to finding good stable matchings in the hospitals/residents setting
The hospitals/residents (HR) problem is a many-to-one generalization of the stable marriage (SM) problem. Researchers have been interested in variants of stable matchings that eit...
Christine Cheng, Eric McDermid, Ichiro Suzuki