Sciweavers

836 search results - page 151 / 168
» Orthogonal Colorings of Graphs
Sort
View
JAIR
2006
179views more  JAIR 2006»
14 years 11 months ago
The Fast Downward Planning System
Fast Downward is a classical planning system based on heuristic search. It can deal with general deterministic planning problems encoded in the propositional fragment of PDDL2.2, ...
Malte Helmert
LACL
2011
Springer
14 years 2 months ago
Using Logic in the Generation of Referring Expressions
The problem of generating referring expressions (GRE) is an important task in natural language generation. In this paper, we advocate for the use of logical languages in the output...
Carlos Areces, Santiago Figueira, Daniel Gor&iacut...
SPAA
2012
ACM
13 years 2 months ago
Allowing each node to communicate only once in a distributed system: shared whiteboard models
In this paper we study distributed algorithms on massive graphs where links represent a particular relationship between nodes (for instance, nodes may represent phone numbers and ...
Florent Becker, Adrian Kosowski, Nicolas Nisse, Iv...
84
Voted
DAC
2000
ACM
16 years 21 days ago
Fingerprinting intellectual property using constraint-addition
Recently, intellectual property protection (IPP) techniques attracted a great deal of attention from semiconductor, system integration and software companies. A number of watermar...
Gang Qu, Miodrag Potkonjak
ICYCS
2008
IEEE
15 years 6 months ago
FAST CASH: FAir and STable Channel ASsignment on Heterogeneous Wireless Mesh Network
— Nowadays wireless mesh routers are facilitating with more wireless channels than ever because of the advanced wireless communication technologies such as OFDM, SDR and CR(cogni...
Panlong Yang, Guihai Chen