Sciweavers

8437 search results - page 151 / 1688
» Preferences over Sets
Sort
View
CIE
2009
Springer
16 years 29 days ago
Decidability of Sub-theories of Polynomials over a Finite Field
Abstract. Let Fq be a finite field with q elements. We produce an (effective) elimination of quantifiers for the structure of the set of polynomials, Fq[t], of one variable, in...
Alla Sirokofskich
MOBIQUITOUS
2007
IEEE
16 years 20 days ago
Using Semantic Policies to Reason over User Availability
— According to the IETF definition, “presence conveys the ability and willingness of a user to communicate across a set of devices”. In this paper we use semantic techniques ...
Sandford Bessler, Joachim Zeiss
ITICSE
2006
ACM
16 years 10 days ago
IREEL: remote experimentation with real protocols and applications over emulated network
: This paper presents a novel e­learning platform  called   IREEL.   IREEL   is   a   virtual   laboratory   allowing  students to drive experiments with real...
Laurent Dairaine, Ernesto Exposito, Guillaume Jour...
INFOCOM
1999
IEEE
15 years 10 months ago
TCP and UDP Performance over a Wireless LAN
We present a comprehensive set of measurements of a 2.4 GHz DSSS wireless LAN and analyze its behavior. We examine issues such as host and interface heterogeneity, bidirectional (T...
George Xylomenos, George C. Polyzos
AAAI
2006
15 years 7 months ago
Controlled Search over Compact State Representations, in Nondeterministic Planning Domains and Beyond
Two of the most efficient planners for planning in nondeterministic domains are MBP and ND-SHOP2. MBP achieves its efficiency by using Binary Decision Diagrams (BDDs) to represent...
Ugur Kuter, Dana S. Nau