Sciweavers

1022 search results - page 165 / 205
» Challenges for Constraint Programming in Networking
Sort
View
CNSM
2010
14 years 10 months ago
An investigation on the identification of VoIP traffic: Case study on Gtalk and Skype
The classification of encrypted traffic on the fly from network traces represents a particularly challenging application domain. Recent advances in machine learning provide the opp...
Riyad Alshammari, A. Nur Zincir-Heywood
95
Voted
FCT
2007
Springer
15 years 6 months ago
Rewriting Systems with Data
Abstract. We introduce a uniform framework for reasoning about infinitestate systems with unbounded control structures and unbounded data domains. Our framework is based on constr...
Ahmed Bouajjani, Peter Habermehl, Yan Jurski, Miha...
GECCO
2005
Springer
138views Optimization» more  GECCO 2005»
15 years 6 months ago
Artificial immune system for solving generalized geometric problems: a preliminary results
Generalized geometric programming (GGP) is an optimization method in which the objective function and constraints are nonconvex functions. Thus, a GGP problem includes multiple lo...
Jui-Yu Wu, Yun-Kung Chung
COMPSAC
2009
IEEE
15 years 4 months ago
Tamper Resistance for Software Defined Radio Software
The security of software defined radio (SDR) software is essential to the trustworthiness of the overall radio system. When designing and developing security solutions for SDR sof...
Shucai Xiao, Jung-Min Park, Yanzhu Ye
116
Voted
ICASSP
2010
IEEE
15 years 21 days ago
A convex relaxation for approximate maximum-likelihood 2D source localization from range measurements
This paper addresses the problem of locating a single source from noisy range measurements in wireless sensor networks. An approximate solution to the maximum likelihood location ...
Pinar Oguz-Ekim, João Pedro Gomes, Jo&atild...